Integrated circuit defect detection and repair

ABSTRACT

In accordance with the present description, a device includes an internal defect detection and repair circuit which includes a self-test logic circuit built in within the device and a self-repair logic circuit also built in within the device. In one embodiment, the built in self-test logic circuit may be configured to automatically identify defective memory cells in a memory. Upon identifying one or more defective memory cells, the built in self-repair logic circuit may be configured to automatically repair the defective memory cells by replacing defective cells with spare cells within the memory. In one embodiment, data patterns are generated as a function of memory addresses and periodic address offsets. Other aspects are described herein.

TECHNICAL FIELD

The present invention relates generally to devices having memory withbuilt-in self-test functionality.

BACKGROUND

Integrated circuit devices such as random access memories (RAMs) usuallyundergo device verification testing during manufacture. Typically, suchverification tests are designed to detect both static and dynamicdefects in a memory array. Static defects include, for example, opencircuit and short circuit defects in the integrated circuit device.Dynamic defects include defects such as weak pull-up or pull-downtransistors that create timing sensitive defects. Defects which havebeen identified in a memory may be repaired by issuing commands to thedevice to replace defective memory cells with spare memory cells placedon the device for that purpose. Such replacement is typically achievedby opening and closing fuses within the memory array.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic diagram of one embodiment of a computerarchitecture device employing self-test and repair in accordance withone aspect of the present description.

FIG. 2 is a more detailed schematic diagram of one embodiment ofautomated self-test and repair logic on board the computer architecturedevice of FIG. 1.

FIG. 3a is a more detailed schematic diagram of one embodiment of aprogrammable stress test pattern generator of the self-test logic ofFIG. 2.

FIG. 3b is a schematic diagram of nested instructions of one embodimentof a programmable stress test pattern generator of the self-test logicof FIG. 2.

FIG. 3c is a schematic diagram of one example of a stress test patternwhich may be generated by the programmable stress test pattern generatorof the self-test logic of FIG. 2, in response to a sequence of stresstest instructions provided to the programmable stress test patterngenerator.

FIG. 3d is a schematic diagram of another example of a stress testpattern which may be generated by the programmable stress test patterngenerator of the self-test logic of FIG. 2, in response to a sequence ofstress test instructions provided to the programmable stress testpattern generator.

FIG. 3e is a schematic diagram of yet another example of a stress testpattern which may be generated by the programmable stress test patterngenerator of the self-test logic of FIG. 2, in response to a sequence ofstress test instructions provided to the programmable stress testpattern generator.

FIG. 3f is a more detailed schematic diagram of one embodiment ofpattern generators of a programmable stress test pattern generator ofthe self-test logic of FIG. 2.

FIG. 4 depicts one embodiment of operations in accordance with oneaspect of the present description, of the programmable stress testpattern generator of the self-test logic of FIG. 2, generating stresstest patterns in response to sequences of stress test instructionsarranged in nested loops.

FIG. 5 depicts one embodiment of operations in accordance with oneaspect of the present description, of the defect detector logic circuitof FIG. 2, detecting and recording addresses of memory locationscontaining a defective memory cell in a repair list repository.

FIG. 6 is a schematic diagram of one embodiment of a repair listrepository in accordance with one aspect of the present description.

FIG. 7 is a schematic diagram of one embodiment of the self-repair logicof FIG. 2.

FIGS. 8a-8h are schematic diagrams of examples of configurations of aconfigurable pipeline address generator of the self-test logic of FIG.1.

FIGS. 9a-9c are examples of operations of various configurations of aconfigurable pipeline address generator of the self-test logic of FIG.1.

FIG. 10 is an example of operations of pipestages of a configurablepipeline address generator of the self-test logic of FIG. 1.

FIG. 11 is a schematic diagram of clock cycle intervals of operation ofpipestages of a configurable pipeline address generator of the self-testlogic of FIG. 1.

FIG. 12 is a schematic diagram of one example of an algorithm generatorof the self-test logic of FIG. 1, configured as a variable refreshsignal generator.

FIG. 13 is a schematic diagram of another example of an algorithmgenerator of the self-test logic of FIG. 1.

FIG. 14 is a table depicting examples of Boolean function based modes ofoperation of the algorithm generator of FIG. 13.

FIG. 15 shows one example of a multi-mode pattern sequencer of thealgorithm generator of FIG. 13.

FIG. 16 shows one example of a clock signal which may be generated inone mode of the multi-mode pattern sequencer of the algorithm generatorof FIG. 13.

FIG. 17 is a schematic diagram showing examples of bits of a linearfeedback shift register based finite state machine of multi-mode patternsequencer of the algorithm generator of FIG. 13.

FIG. 18a is an example of operations of a data generator of theself-test logic of FIG. 1.

FIG. 18b is a schematic diagram of one example of a data generator ofthe self-test logic of FIG. 1.

FIGS. 19a-19g are examples of data inversion patterns which may begenerated for a memory region under test by the data generator of FIG.18 b.

FIG. 20a is an example of operations of an address offset generator ofthe self-test logic of FIG. 1.

FIG. 20b is a schematic diagram of one example of an address offsetgenerator of the self-test logic of FIG. 1.

FIG. 21 is an example of a table of parameters for an address offsetinstruction for the address offset generator of FIG. 20 b.

FIG. 22 is a schematic diagram of one example of chained inversionfunction stages of the self-test logic of FIG. 1.

FIG. 23 is a schematic diagram illustrating one example of a data lanerotation function of the self-test logic of FIG. 1.

DESCRIPTION OF EMBODIMENTS

A specialized integrated circuit device tester is normally employed toperform manufacturing verification tests. Such testing apparatus istypically controlled by a human operator or automation system using acomputer executing test software. To test a memory device, test patternsof various memory addresses, memory commands and test data may be readfrom the computer memory or otherwise generated, and applied via thedevice tester to the devices under test. Typically, the devices undertest are on a semiconductor wafer or may be on a die cut from the wafer.

Test data read from the devices in response to applied test patterns, iscompared by the external tester software to expected results to identifydefects. Defects in memory devices identified in this manner, may insome instances be repaired by issuing commands to the device containinga memory defect. For example, in some memory circuits, a row of memorycells containing a defective memory cell may be replaced by spare row ofmemory cells.

Some integrated circuit devices have built-in self-test (BIST)circuitry. For example, an integrated circuit memory array may containcircuitry to perform a standard static random access memory (SRAM) 13NMarch test algorithm on the memory array. A state machine is typicallyused to generate the 13N March test algorithm along with circuitry tosample data output and to generate a signature of the results. Thesignature is then compared against an expected value to determinewhether defects exist in the memory array.

Unfortunately, these known BIST routines have often been limited toapplying a fixed test sequence on the memory array. As the process ofmanufacturing such a memory array evolves, manufacturing test engineerstypically develop improved strategies for detecting both static anddynamic defects in the memory array.

Moreover, such improved strategies for detecting defects have typicallybeen applied to testing that occurs while the device is placed in anexpensive integrated circuit device tester. Therefore, engineers havefrequently been unable to achieve the benefits of improved teststrategies without the use of an expensive tester, or withoutredesigning the integrated circuit device. Because of the advances inmemory technology, and particularly in the area of narrow high-speedbuses, which typically run at speeds in the GHz range, for use withdynamic random access memory devices (DRAMs), it is very expensive toobtain a high-speed tester capable of testing a memory module or amemory component at such high operating frequencies. Therefore, theadded use of expensive high-speed hardware testers increases the overallmanufacturing cost of these memory modules and memory components.

FIG. 1 illustrates one embodiment of a computer architecture device 100employing defect detection and repair in accordance with one aspect ofthe present description. The computer architecture device 100 maycomprise any computing device known in the art, such as a mainframe,server, personal computer, workstation, telephony device, networkappliance, virtualization device, storage controller, portable or mobiledevices (e.g., laptops, netbooks, tablet computers, personal digitalassistant (PDAs), portable media players, portable gaming devices,digital cameras, mobile phones, smartphones, feature phones, etc.) orcomponent (e.g. system on a chip, processor, bridge, memory controller,memory, etc.). The architecture device 100 may include a processor 102(e.g., a microprocessor), a memory 104 (e.g., a volatile or nonvolatilememory device), and a memory controller 106 which controls input andoutput operations to and from the memory 104.

As explained in greater detail below, the memory controller 106 includesan internal defect detection and repair circuit 108 which includes aself-test logic circuit 110 built in within the device 100 and aself-repair logic circuit 114 also built in within the device 100. Thebuilt in self-test logic circuit 110 may be configured to automaticallyidentify defective memory cells in the memory 104. Upon identifying oneor more defective memory cells, the built in self-repair logic circuit114 may be configured to automatically repair the defective memory cellsby replacing defective cells with spare cells within the memory 104. Thememory die may be included in the same package as the logic die havingthe self-test logic circuit 110 the self-repair logic circuit 114.Alternatively, the memory die could be outside the package of the logicdie, on top of the logic die, adjacent to the logic die or on a plug inmodule such as a dual in line memory module (DIMM).

As used herein, the term “automated” includes fully automated in whichonce stress testing of the device is initiated, the test and repairoperations of the device proceed through repair of at least one memorylocation without any user intervention. Also, the term “automated”includes substantially automated in which once stress testing of thedevice is initiated, the test and repair operations of the deviceproceed through repair of at least one memory location with limited userintervention. However, most of the test and repair operations proceedwithout any user intervention. In some embodiments, at least 50%, atleast 75% or at least 95% of the test and repair operations proceedwithout any user intervention.

In the illustrated embodiment, the memory controller 106 is disposed ona semiconductor die within the device 100 and the internal self-testlogic circuit 110 and the internal self-repair logic circuit 114 of thecircuit 108 are disposed on the same die of the memory controller 106.Thus, although the internal self-test logic circuit 110 and the internalself-repair logic circuit 114 are depicted as built in to the memorycontroller 106, it is appreciated that the internal self-test logiccircuit 110 and the internal self-repair logic circuit 114 may be builtin to other circuits of the computer architecture device 100.

As explained in greater detail below, the internal self-test logiccircuit 110 is capable of generating a wide range of test patterns fortesting the memory 104. Moreover, in some embodiments, the test patternsgenerated by the internal self-test logic circuit 110 may be readilymodified as conditions warrant. In one embodiment, the generated patternof data may be selected to be a function of the pattern of memory celladdresses of the memory cells in which the generated pattern of data isto be written. As explained in greater detail below, a variety of datapatterns may be readily generated as a function of memory addressesincluding inverting data in a striped pattern, or a checkerboardpattern, or other pattern, for example, depending upon the selectedmemory address-based function.

In another embodiment, bit positions of the generated pattern of datamay be selectively rotated and the rotation of a generated pattern ofdata may be selectively repeated a selectable number of times for allmemory cell addresses of the memory cells in which the generated patternof data is to be written. In still another embodiment, the generatedpattern of data may be selected to be a function of a periodic patternof memory address offsets to the memory addresses of the memory cells inwhich the generated pattern of data is to be written. An address offsetgenerator may in response to a memory address offset instruction (alsoreferred to as an offset address instruction) generates a periodicpattern of memory address offsets as a function of a period. Asexplained below, an address offset generator may be configured togenerate periodic address offsets for inverting data in a diagonalpattern of memory cells, for example, as a function of the number ofrows or the number of columns of memory region under test.

If the internal defect detection and repair circuit 108 is located onthe same die as the memory cells, the defect detection and repaircircuit may be activated to test for and repair memory defects duringthe manufacture process at the wafer or die level but also aftersemiconductor components have been assembled and packaged. If the defectdetection and repair circuit is located on a separate die such as alogic device, the defect detection and repair circuit may be used totest the memory device or devices after the memory has been connected toa device containing the defect detection and repair circuit. Further, itis appreciated that in some embodiments, the internal defect detectionand repair circuit 108 may be activated to test for and repair memorydefects should a memory failure occur after the device 100 has beenpackaged in a housing and sold to consumers. Thus, the internal defectdetection and repair circuit 108 may interrupt normal memorytransactions between the processor 102 and memory 104 to conduct memorytest and repair operations.

The computer architecture device 100 may further include storage 116(e.g., a non-volatile storage, such as magnetic disk drives, opticaldisk drives, a tape drive, flash memory, etc.). The storage 116 maycomprise an internal storage device or an attached or network accessiblestorage. Programs in the storage 116 are loaded into the memory 104 andexecuted by the processor 102 in a manner known in the art. The computerarchitecture device 100 further includes a network controller or adapter118 to enable communication with a network, such as an Ethernet, a FiberChannel Arbitrated Loop, etc. Further, the architecture may, in certainembodiments, include a video controller 120 to render information on adisplay monitor, where the video controller 120 may be embodied on avideo card or integrated on integrated circuit components mounted on amotherboard or other substrate. An input device 122 is used to provideuser input to the processor 102, and may include a keyboard, mouse,pen-stylus, microphone, touch sensitive display screen, input pins,sockets, or any other activation or input mechanism known in the art. Anoutput device 124 is capable of rendering information transmitted fromthe processor 102, or other component, such as a display monitor,printer, storage, output pins, sockets, etc. The network adapter 118 mayembodied on a network card, such as a Peripheral Component Interconnect(PCI) card, PCI-express, or some other I/O card, or on integratedcircuit components mounted on a motherboard or other substrate.

The internal defect detection and repair circuit 108 includes a portal126 through which test and repair input and output information may bepassed among the defect detection and repair circuit 108 and the othercomponents of the device 100 and if appropriate, to devices external tothe computer architecture device 100 via an input device 122 and anoutput device 118. One example of the portal 126 is an on-chipcommunication network or fabric side band. In one embodiment, the portal126 may be accessed externally through a Test Access Port (TAP) system.Other communication portals may be utilized, depending upon theparticular application.

One or more of the components of the device 100 may be omitted,depending upon the particular application. For example, a network routermay lack a video controller 120, for example. Also, any one or more ofthe components of the computer architecture device 100 may include oneor more integrated circuits having an on-die defect detection and repaircircuit as described herein.

FIG. 2 shows a more detailed example of an internal defect detection andrepair circuit 108 in accordance with the present description. Thedefect detection and repair circuit 108 includes a test patterngenerator 210 for generating test patterns, writing test data to thememory device, sending a copy of the data to a defect detector circuit220, and sending a series of read commands to read back the test data.The read data from the memory device is routed to the defect detectorcircuit 220 where the expected data from the test patter generator 210is compared to the actual data from the memory device to detectdefective memory cells in the memory 104 in response to the testpatterns testing the memory cells of the memory 104.

The defect detector circuit 220 stores in a memory 224 configured as arepair list repository also disposed within the device 108, a list ofmemory locations of the memory 104, each memory location of the listhaving a set of memory cells which includes at least one defectivememory cell in the memory 104. The self-repair logic circuit 114includes logic circuitry adapted to read the list of memory locationsstored in the repair list repository 224, and to repair the memorylocations of the list. In the illustrated embodiment, the memorylocations of the list may be repaired by substituting a memory locationof spare memory cells 230 of the memory 104, for a memory locationhaving at least one defective memory cell.

In one embodiment, the repair list repository may also include registeror other memory locations for various flags 234. For example, a flag maybe set indicating that the number of memory locations having at leastone defective memory cell exceeds the maximum for a particular memoryregion of the memory 104. Another flag may be set for each memoryregion, indicating whether at least one row of the particular memoryregion has at least one defective memory cell within the particularmemory region. Other flags 234 may be stored in the repair listrepository 224, depending upon the particular application.

FIGS. 3a, 3b, 3f , 4 show a more detailed example of the test patterngenerator 210 of FIG. 2, in accordance with one embodiment of thepresent description. The logic depicted in FIGS. 3a, 3b , 4 may beimplemented in one embodiment, with a hardware finite state machine onboard the die of the memory controller 106. This finite state machinemay in turn be implemented with hardware logic gates or a software orfirmware programmable processor or a combination thereof on the same dieas the memory controller 104 or other internal die of the device 100.

The test pattern generator 210 includes a plurality of generatorsincluding a programmable address pattern generator 306 which includes atleast one address generator 310 a, 310 b . . . 310 n (FIG. 3f ), and aloop sequencer circuit 320 adapted to apply to an appropriate one ormore of the generators 310 a, 310 b . . . 310 n of the programmableaddress generator 306, a plurality of nested loop instructions,including a sequential loop 322 (FIG. 3b ) of address instructions in asequence 324 (FIG. 3a ) of address instructions, Address Instruction 1,Address Instruction 2 . . . Address Instruction n, to an addressgenerator 310 a, 310 b . . . 310 n. Each address generator 310 a, 310 b. . . 310 n may include one or more finite state machines. Each addressinstruction, Address Instruction 1, Address Instruction 2 . . . AddressInstruction n, of the sequence 324 when executed by an appropriateaddress generator 310 a, 310 b . . . 310 n, causes that addressgenerator 310 a, 310 b . . . 310 n to generate a pattern of memory celladdresses as a function of the particular address instruction, AddressInstruction 1, Address Instruction 2 . . . Address Instruction n, andthe particular address generator 310 a, 310 b . . . 310 n, to which itis applied. The test pattern generator 210 (FIG. 2) is adapted toexecute memory commands at memory cells addressed by a pattern of memorycell addresses generated by an address instruction, Address Instruction1, Address Instruction 2 . . . Address Instruction n, being executed insequence in the loop 322 (FIG. 3b ) of address instructions. A counterof the counters 323 of the instruction loop sequencer 320, generates apointer to the sequence 324 (FIG. 3a ) of address instructions, AddressInstruction 1, Address Instruction 2 . . . Address Instruction n, whichin turn generates the current address instruction to be used. Parametersof the address instructions may include parameters identifying the sizeof the memory region to be tested, a starting address of the memoryregion to be tested, and a parameter indicating that a particularaddress instruction is the last address instruction of the sequence.Additional examples of parameters for address instructions are providedbelow. It is appreciated that other parameters may be included orutilized, depending upon the particular application.

For example, FIG. 3b shows a plurality 328 of nested instruction loopsincluding a data instruction loop 330 nested within the addressinstruction loop 322, an algorithm instruction loop 332 nested withinthe data instruction loop 330, a command instruction loop 334 nestedwithin the algorithm instruction loop 332, and selectable offsetinstruction loops 336 a, 336 b of a set 337 of offset instructionsnested within the command instruction loop 334. It is appreciated thatin some embodiments, the number and type of nested instruction loops maydiffer from those illustrated and the order of nesting may be changed aswell, depending upon the particular application.

FIG. 3c shows an example of an address pattern which may be generated byone of the address generators 310 a, 310 b . . . 310 n such as addressgenerator 310 a, for example, in response to one of the addressinstructions, Address Instruction 1, Address Instruction 2 . . . AddressInstruction n, such as Address Instruction 1, for example, for a memoryregion 338 of memory cells 340 of the memory 104. The memory region 338is represented by a four by four array of memory cells 340 arranged incolumns and rows. A typical memory region may be substantially largerand thus may have memory cells numbering in the kilobytes, megabytes,gigabytes, terabytes or more. One example of a memory region is oftenreferred to as a “bank.” Each memory cell 340 may store a single bit, abyte, a word or a longer string of bits, depending upon the particularapplication.

In this example, the address pattern generated is a “walking” pattern inwhich the generated address of the address pattern “walks” to the nextadjacent memory cell of a particular column of memory cells 340. Thus,the address pattern may start at a particular memory cell address whichmay be represented as an ordered pair of a column address and a rowaddress such the column-row address (0, 0) depicted in FIG. 3c . Thenext address of this particular address pattern may be generated byincrementing the row address portion of the memory cell address to thecolumn-row address (0, 1) depicted in FIG. 3c . The remaining addressesof the remaining memory cells of the column are sequentially generatedin this fashion.

Once the end of the column is reached, the row address portion may bereset to the original row address and the column address may beincremented to the column-row address (1, 0) depicted in FIG. 3c . Theremaining addresses of the memory remaining memory cells of the region338 are sequentially generated in this fashion. Once the end of the lastcolumn is reached, the final column-row address (3, 3) of the addresspattern is depicted in FIG. 3 c.

The address pattern which is generated may be readily changed bychanging the address instruction, or changing the address generator towhich the address instruction is applied, or both. Thus, in the exampledepicted in FIG. 3c , the direction of cell walking may be reversed fromthat shown in FIG. 3c , by providing an appropriate address instructionto an address generator. Other address patterns may walk up one columnand then walk down another column, for example. Other address patternsmay walk across a row before changing to a different row instead ofwalking up or down a column. Other address patterns for traversing amemory which are suitable for stress testing a memory may be readilyimplemented by appropriate selection of address instructions and addressgenerator designs. Thus, parameters of the address instruction mayinclude a parameter defining address generation direction. It isappreciated that other parameters may be included or utilized, dependingupon the particular application. It is appreciated that providingmultiple address instructions for multiple address generatorsfacilitates implementation of a suitable stress tests for a memory.

In the illustrated embodiment, the sequence 324 (FIG. 3a ) of addressinstructions, Address Instruction 1, Address Instruction 2 . . . AddressInstruction n, applied to the address generators 310 a, 310 b . . . 310n, may comprise a sequence of four address instructions, for example. Itis appreciated that the number of address instructions in a sequence ofaddress instructions, may vary, depending upon the particularapplication.

The test pattern generator 210 further includes a programmable datapattern generator 342 which includes at least one data generator 344 a,344 b . . . 344 n (FIG. 30. The loop sequencer circuit 320 is adapted toapply to appropriate ones of the data generators 344 a, 344 b . . . 344n, a plurality of nested loop instructions, including a sequential loop330 (FIG. 3b ) of data instructions in a sequence 346 (FIG. 3a ) of datainstructions, Data Instruction 1, Data Instruction 2 . . . DataInstruction n. A counter of the counters 323 of the instruction loopsequencer 320, generates a pointer to the sequence 346 (FIG. 3a ) ofdata instructions, which in turn generates the current addressinstruction to be used. A parameter of the data instructions may includea parameter indicating that a particular data instruction is the lastaddress instruction of the sequence. It is appreciated that otherparameters may be included or utilized, depending upon the particularapplication. Each data generator 344 a, 344 b . . . 344 n may includeone or more finite state machines. Each data instruction, DataInstruction 1, Data Instruction 2 . . . Data Instruction n, of thesequence 346 when executed by an appropriate one of the data generators344 a, 344 b . . . 344 n, causes that data generator 344 a, 344 b . . .344 n to generate a data pattern as a function of the particular datainstruction, Data Instruction 1, Data Instruction 2 . . . DataInstruction n, and the particular data generator 344 a, 344 b . . . 344n, to which it is applied.

The test pattern generator 210 (FIG. 2) is adapted to execute memorycommands at memory cells to write a pattern of test data generated by adata instruction being executed in sequence 346 in the loop 330 (FIG. 3b) of data instructions, Data Instruction 1, Data Instruction 2 . . .Data Instruction n, in memory cells addressed by a pattern of memorycell addresses generated by an address instruction being executed insequence in the loop of address instructions. Thus, in the example ofFIG. 3c , a data generator such as the data generator 344 a, forexample, of the programmable data pattern generator 342, may generate astring of data bits, such as all ones, for example, in response to oneof the data instructions such as Data Instruction 1, for example. Agenerated data bit of the generated data pattern, is written, forexample, into each memory cell 340 by the test pattern generator 210 asthe address generator 310 a, for example, in response to one of theaddress instructions, such as Address Instruction 1, for example,generates the walking address pattern depicted for a memory region 338of memory cells 340 of the memory 104. Other examples of data patternswhich may be generated by the programmable data pattern generator 342include strings of 0's, checkerboard patterns of alternating 1's and0's, etc. depending upon the particular application. Thus, the dataoutput by the programmable data pattern generator 342 may be used aswrite data, for example, to stress test the memory 104 as commands areexecuted at memory addresses traversing the memory 104. Furthermore, thedata output by the programmable data pattern generator 342 may also beused as expected test result data to compare to actual test dataobtained as the memory 104 is stress tested. Still further, thegenerated data patterns may also be used as control signals to controlthe control signal inputs of the memory 104. Thus, parameters of thedata instruction may include parameters indicating whether to invertdata and indicating various data backgrounds such as solid, columnstripes, row stripes, checkerboard etc. It is appreciated that otherparameters may be included or utilized, depending upon the particularapplication.

In the illustrated embodiment, the sequence 346 (FIG. 3a ) of datainstructions, Data Instruction 1, Data Instruction 2 . . . DataInstruction n, applied to the appropriate data generators 344 a, 344 b .. . 344 n, may comprise a sequence of four data instructions, forexample. It is appreciated that the number of data instructions in asequence of data instructions, may vary, depending upon the particularapplication.

The test pattern generator 210 further includes a programmable algorithmpattern generator 350 which includes at least one algorithm generator354 a, 354 b . . . 354 n (FIG. 3f ). The loop sequencer circuit 320 isadapted to apply to appropriate ones of the algorithm generators 354 a,354 b . . . 354 n, a plurality of nested loop instructions, including asequential loop 332 (FIG. 3b ) of algorithm instructions in a sequence356 (FIG. 3a ) of algorithm instructions, Algorithm Instruction 1,Algorithm Instruction 2 . . . Algorithm Instruction n. A counter of thecounters 323 of the instruction loop sequencer 320, generates a pointerto the sequence 356 (FIG. 3a ) of algorithm instructions, which in turngenerates the current algorithm instruction to be used. A parameter ofthe algorithm instructions may include a parameter indicating that aparticular algorithm instruction is the last algorithm instruction ofthe sequence. It is appreciated that other parameters may be included orutilized, depending upon the particular application. Each algorithmgenerator 354 a, 354 b . . . 354 n may include one or more finite statemachines. Each algorithm instruction, Algorithm Instruction 1, AlgorithmInstruction 2 . . . Algorithm Instruction n, of the sequence 356 whenexecuted by an appropriate one of the algorithm generators 354 a, 354 b. . . 354 n, causes that algorithm generator 354 a, 354 b . . . 354 n togenerate a test data pattern as an output of an algorithm.

In one embodiment, the programmable algorithm test generator 350 inputsthe data pattern generated by the programmable data pattern generator342, and modifies the input data pattern to a modified data pattern inaccordance with the algorithm of the selected algorithm generator 354 a,354 b . . . 354 n executing the selected algorithm instruction,Algorithm Instruction 1, Algorithm Instruction 2 . . . AlgorithmInstruction n, of the sequence 356. In other embodiments, theprogrammable algorithm test generator 350 generates a data pattern as afunction of the particular algorithm instruction, Algorithm Instruction1, Algorithm Instruction 2 . . . Algorithm Instruction n, and theparticular algorithm generator 354 a, 354 b . . . 354 n, to which it isapplied, without inputting the data pattern generated by theprogrammable data pattern generator 342.

The test pattern generator 210 (FIG. 2) is adapted to execute memorycommands at memory cells to write a data test pattern in accordance withan algorithm instruction being executed in sequence 356 in the loop 332of algorithm instructions, Algorithm Instruction 1, AlgorithmInstruction 2 . . . Algorithm Instruction n, in memory cells addressedby a pattern of memory cell addresses generated by an addressinstruction being executed in sequence in the loop of addressinstructions. Thus, the data output by the programmable algorithm testgenerator 350 may be used as write data, for example, to stress test thememory 104 as commands are executed at memory addresses traversing thememory 104. Sill further, the data output by the programmable algorithmtest generator 350 may also be used as expected test result data tocompare to actual test data obtained as the memory 104 is stress tested.Still further, the generated data patterns may also be used as controlsignals to control the control signal inputs of the memory 104.

One example of an algorithm which may be generated by a selectedalgorithm generator 354 a, 354 b . . . 354 n, such as the algorithmgenerator 354 a, for example, executing a selected algorithminstruction, Algorithm Instruction 1, Algorithm Instruction 2 . . .Algorithm Instruction n, such as the Algorithm Instruction 1, forexample, of the sequence 356, is a shift register based random patternalgorithm which may be used for testing interconnects of the memory 104,for example. These random patterns generated by an algorithm generatorsuch as the algorithm generator 354 a, for example, executing a selectedalgorithm instruction, such as the Algorithm Instruction 1, for example,are believed to create white noise on an interconnect to stress theinterconnect to test for a defect. As described above, the randompattern may be generated by modifying a test data pattern generated by agenerator of the programmable data pattern generator 342, using analgorithm generator of the programmable algorithm pattern generator 350.Alternatively, the random pattern may be generated by an algorithmgenerator of the programmable algorithm pattern generator 350 withoutmodifying a test data pattern generated by a generator of theprogrammable data pattern generator 342.

Another example an algorithm which may be generated by a selectedalgorithm generator 354 a, 354 b . . . 354 n, such as the algorithmgenerator 354 b, for example, executing a selected algorithminstruction, Algorithm Instruction 1, Algorithm Instruction 2 . . .Algorithm Instruction n, such as the Algorithm Instruction 2, forexample, of the sequence 356, is a neighbor interaction based addresswalking algorithm. This algorithm may be used, for example, for testingmemory cells of dynamic random access memories which are primarilycapacitive in nature. In accordance with the neighbor interaction basedaddress walking algorithm, if all neighboring cells in the memory areswitched, a cross coupling effect may cause a cell under test to flip tothe wrong digital value.

FIG. 3d shows an example of a neighbor interaction based address walkingalgorithm which may be generated by the algorithm generator 354 b, forexample, executing the Algorithm Instruction 2, for example, of thesequence 356, for a memory region 358 of memory cells 340 of the memory104. The memory region 358 is represented by a seven by twelve array ofmemory cells 340 arranged in columns and rows.

In this algorithm a memory cell 340 a designated “Base”, the address ofwhich is generated by an address generator as a “base address”, isstressed by neighbors cells within two cells away from it. Thus the testpattern generator 210 (FIG. 2) is adapted to execute a first set ofmemory commands, write (Wr 1) and read (Rd 1) at a first neighbor memorycell 340 b, a second set of memory commands, write (Wr 2) and read (Rd2) at a second neighbor memory cell 340 b, and so on finishing with aneighth set of memory commands, write (Wr 8) and read (Rd 8) at an eighthneighbor memory cell 340 d, in accordance with a neighbor interactionbased address walking algorithm which may be generated by the algorithmgenerator 354 b, for example, executing the Algorithm Instruction 2, forexample, of the sequence 356.

Parameters of the algorithm instructions may further include parametersindicating the starting command of a sequence of commands, the startingaddress direction for that sequence of commands, whether data is to beinverted, one or more wait periods to prevent a new algorithminstruction from beginning until the wait condition is satisfied,whether to reset a counter such an instruction counter for a sequence ofinstructions such as a sequence of command instructions, for example. Itis appreciated that other parameters may be included or utilized,depending upon the particular application.

It is appreciated that the algorithm instructions, Algorithm Instruction1, Algorithm Instruction 2 . . . Algorithm Instruction n, of thesequence 356 when executed by an appropriate one of the algorithmgenerators 354 a, 354 b . . . 354 n, may implement other algorithms forstress testing the memory 104, depending upon the particularapplication. In the illustrated embodiment, the sequence 356 (FIG. 3a )of algorithm instructions, Algorithm Instruction 1, AlgorithmInstruction 2 . . . Algorithm Instruction n applied to the appropriatealgorithm generators 354 a, 354 b . . . 354 n, may comprise a sequenceof eight algorithm instructions, for example. It is appreciated that thenumber of algorithm instructions in a sequence of algorithminstructions, may vary, depending upon the particular application.

The test pattern generator 210 further includes a programmable commandpattern generator 360 which includes at least one command generator 364a, 364 b . . . 364 n (FIG. 3f ). The loop sequencer circuit 320 isadapted to apply to appropriate ones of the command generators 364 a,364 b . . . 364 n, a plurality of nested loop instructions, including asequential loop 334 (FIG. 3b ) of command instructions in a sequence 366(FIG. 3a ) of command instructions, Command Instruction 1, CommandInstruction 2 . . . Command Instruction n. A counter of the counters 323of the instruction loop sequencer 320, generates a pointer to thesequence 366 (FIG. 3a ) of command instructions, which in turn generatesthe current command instruction to be used. A parameter of the commandinstructions may include a parameter indicating that a particularcommand instruction is the last command instruction of the sequence. Itis appreciated that other parameters may be included or utilized,depending upon the particular application. Each command generator 364 a,364 b . . . 364 n may include one or more finite state machines. EachCommand instruction, Command Instruction 1, Command Instruction 2 . . .Command Instruction n, of the sequence 366 when executed by anappropriate one of the command generators 364 a, 364 b . . . 364 n,causes that command generator 364 a, 364 b . . . 364 n to generate apattern of commands as a function of the particular selected commandgenerator and the particular selected command instruction.

The test pattern generator 210 (FIG. 2) is adapted to execute a patternof memory commands at memory cells in accordance with a commandinstruction being executed in sequence 366 in the loop 334 of commandinstructions, Command Instruction 1, Command Instruction 2 . . . CommandInstruction n, in memory cells addressed by a pattern of memory celladdresses generated by an address instruction being executed in sequencein the loop of address instructions. The data of the write commands isprovided by one or both of the programmable data pattern generator 342and the programmable algorithm generator 350 as discussed above. Inaddition to providing data to be written to the memory 104, thegenerated data patterns may also be used for control signal commands ofthe programmable command pattern generator 360 to control the controlsignal inputs of the memory 104.

In the illustrated embodiment, the sequence 366 (FIG. 3a ) of commandinstructions, Command Instruction 1, Command Instruction 2 . . . CommandInstruction n, which are applied to the appropriate command generators364 a, 364 b . . . 364 n, may comprise a sequence of twenty-four commandinstructions, for example. It is appreciated that the number of commandinstructions in a sequence of command instructions, may vary, dependingupon the particular application.

In one embodiment, each command instructions, Command Instruction 1,Command Instruction 2 . . . Command Instruction n, may instruct anappropriate command generator of the command generators 364 a, 364 b . .. 364 n to generate a single command such as a memory write or memoryread command, for example. In other embodiments, each commandinstruction, Command Instruction 1, Command Instruction 2 . . . CommandInstruction n, may instruct an appropriate command generator of thecommand generators 364 a, 364 b . . . 364 n to generate a sequence ofcommands.

For example, in the stress test pattern depicted in FIG. 3c , a singlecommand, in this example, a write command, is executed for each memorycell of the memory region 338, as the programmable address patterngenerator 306 generates a pattern of addresses which walks through thememory region 338 as shown. FIG. 3e depicts a multi-part stress testwhich employs a sequence of commands. In part 1 of the stress test ofFIG. 3e , in a manner similar to that of the stress test patterndepicted in FIG. 3c , a single command, in this example, a writecommand, is executed for each memory cell of the memory region 338, asthe programmable address pattern generator 306 generates a pattern ofaddresses which walks through the memory region 338 as shown, toinitialize the memory region 338. Once memory region 338 has beeninitialized with a write command to each memory cell in part 1 of thestress test, a sequence of commands, in this example, a quick readcommand (R) followed by a write inverse (Wbar) command, is executed foreach memory cell of the same memory region 338, as the programmableaddress pattern generator 306 again generates the same pattern ofaddresses generated in part 1, which again walks through the memoryregion 338 a second time as shown. Following part 2 of the stress test,another sequence of commands, in this example, a quick read inverse(Rbar) command followed by a write (W) command, is executed for eachmemory cell of the same memory region 338, as the programmable addresspattern generator 306 again generates the same pattern of addressesgenerated in parts 1 and 2, which again walks through the memory region338 a third time as shown.

In one embodiment, each command instruction may be applied to a commonfinite state machine of a command generator. It is appreciated that inother embodiments, command instructions may be applied to differentfinite state machine of various command pattern generators.

In one embodiment, each command instruction defines one command toexecute. A sequence of commands may be provided by a sequence of commandinstructions, each of which may be applied to a particular memoryaddress in sequence. The sequence of commands may then be applied over asequence of different addresses, one address location at a time over thecourse of a stress test. It is appreciated that in other embodiments, acommand instruction may define more than one command in a sequence.

Thus, in one embodiment, parameters of a command instruction may includeparameters indicating a read or write command, whether data for thecommand is to be inverted, identifying an alternate data source, and a“hammer” function” in which specifies repeated write operations. It isappreciated that other parameters may be utilized, depending upon theparticular application.

The test pattern generator 210 further includes a programmable addressoffset pattern generator 370 which includes at least one offsetgenerator of the offset generators 374 a, 374 b . . . 374 n (FIG. 3f ).Each offset generator 374 a, 374 b . . . 374 n is adapted to generate apattern of address offsets to offset a base address generated by theprogrammable address pattern generator 306. The loop sequencer circuit320 is adapted to apply to appropriate ones of the offset generators 374a, 374 b . . . 374 n, a plurality of nested loop instructions, includinga selected sequential loop 336 a, 336 b (FIG. 3b ) of offsetinstructions in a sequence 376 (FIG. 3a ) of offset instructions, OffsetInstruction 1, Offset Instruction 2 . . . Offset Instruction n. Acounter of the counters 323 of the instruction loop sequencer 320,generates a pointer to the sequence 376 (FIG. 3a ) of offsetinstructions, which in turn generates the current offset instruction tobe used. A parameter of the offset instructions may include a parameterindicating that a particular offset instruction is the last offsetinstruction of the sequence. It is appreciated that other parameters maybe included or utilized, depending upon the particular application. Eachoffset generator 374 a, 374 b . . . 374 n may include one or more finitestate machines. Each Offset instruction, Offset Instruction 1, OffsetInstruction 2 . . . Offset Instruction n, of the sequence 376 whenexecuted by an appropriate one of the offset generators 374 a, 374 b . .. 374 n, causes that offset generator 374 a, 374 b . . . 374 n togenerate a pattern of address offsets as a function of the particularselected offset generator and the particular selected offsetinstruction.

The test pattern generator 210 (FIG. 2) in executing memory commands atmemory cells is adapted to execute a pattern of commands generated by acommand instruction being executed in sequence 366 in the loop 334 ofcommand instructions in memory cells addressed by a pattern of memorycell addresses generated by an address instruction being executed insequence 324 in the loop 322 of address instructions and offset by thepattern of memory address offsets generated by a memory address offsetinstructions, Offset Instruction 1, Offset Instruction 2 . . . OffsetInstruction n, being executed in sequence 376 in the loop 336 a, 336 bof memory address offset instructions. In this manner, a base address ofthe address pattern generated by the programmable address patterngenerator 306 may be offset by one or more address offsets of the offsetpattern generated by the programmable offset pattern generator 370. Thedata of the write commands is provided by one or both of theprogrammable data pattern generator 342 and the programmable algorithmgenerator 350 as discussed above.

In the illustrated embodiment, the sequence 376 (FIG. 3a ) of offsetinstructions, Offset Instruction 1, Offset Instruction 2 . . . OffsetInstruction n, which are applied to the appropriate offset generators374 a, 374 b . . . 374 n, may comprise a sequence of two offsetinstructions, for example. It is appreciated that the number of offsetinstructions in a sequence of offset instructions, may vary, dependingupon the particular application.

In one embodiment, one loop of offset instructions such as loop 336 a,for example, may be a loop of offset address instructions which create avariety of possible offset operations in an address range relative tothe current base address. The offset address commands allow a sequenceof offset address commands, such as a sequence of six offset addresscommands, for example, to be sequentially executed in each loop 336 a.An offset address instruction of this loop may include parametersindicating the direction of offset such as north, south, east or west ofthe base address, for example, whether a stripe is involved, and that aparticular offset address instruction is the last offset addressinstruction of the sequence. In one embodiment, the stripe functiondisables the normal carry from row to column or column to row during theoffset address increments. It is appreciated that other parameters maybe included or utilized, depending upon the particular application.

In one embodiment, one loop of offset instructions such as loop 336 b,for example, may be a loop of offset command instructions that may besequentially executed in the loop 336 b. An offset address instructionof this loop may include parameters indicating a read or write command,whether data for the offset command is to be inverted, identifying analternate data source, whether to use the base address or an offsetaddress, a “hammer” function” which specifies repeated write operations,and that a particular offset command instruction is the last offsetcommand instruction of the sequence. It is appreciated that otherparameters may be utilized, depending upon the particular application.

In one embodiment, in connection with a command instruction of thesequence 366 of command instructions, an offset instruction as describedabove may be substituted for a current command instruction by setting anoffset command substitution parameter of the command instruction of thesequence 366. In addition, the offset loop 336 a, 336 b of the offsetcommand to be substituted may be indicated by an offset loop identifyingparameter of the command instruction of the sequence 366. As previouslymentioned, FIG. 3d shows an example of a neighbor interaction basedaddress walking algorithm stress test. In this stress test, a memorycell 340 a designated “Base” is stressed by neighbors cells within twocells away from it. The base address which is the address of the memorycell 340 a, is generated by the programmable address generator 306. Theaddresses of the neighbors of the base cell 340 a are generated bymodifying the base address of the base cell 340 a with the addressoffsets generated by the programmable address offset pattern generator370. For example, the address of the neighbor cell 340 b may begenerated by adding a column offset of “one” to the address of the basecell 340. The address of the neighbor cell 340 c may be generated byadding a column offset of “two” to the address of the base cell 340 a ormay be generated by adding a column offset of “one” to the generatedaddress of the neighbor cell 340 b. Similarly, the address of theneighbor cell 340 d may be generated by subtracting a row offset of“two” from the address of the base cell 340 a. The address offsets maybe generated by the offset generator 374 a, for example, executing theOffset Instruction 1, for example.

Thus the test pattern generator 210 (FIG. 2) is adapted to execute afirst set of memory commands, write (Wr 1) and read (Rd 1) at a firstneighbor memory cell 340 b, a second set of memory commands, write (Wr2) and read (Rd 2) at a second neighbor memory cell 340 b, and so onfinishing with an eighth set of memory commands, write (Wr 8) and read(Rd 8) at an eighth neighbor memory cell 340 d, in accordance with aneighbor interaction based address walking algorithm at addresses whichmay be generated by the programmable address generator 306, offset bythe address offset pattern generated by the programmable address offsetgenerator 370.

FIG. 4 depicts one example of operations of the self-test logic 110 ofFIG. 1 implementing the nested loop structure depicted in FIG. 3b . Theinstruction sequences may In a first operation, address instructionselection is initialized (block 410) to select the first addressinstruction such as Address Instruction 1, for example. It isappreciated that address instruction selection may be initialized toselect another address instruction of the sequence 324 of addressinstructions, depending upon the particular application. In a similarmanner, data instruction selection is initialized (block 412) to selectthe first data instruction such as Data Instruction 1, for example,algorithm instruction selection is initialized (block 414) to select thefirst algorithm instruction such as Algorithm Instruction 1, forexample, command instruction selection is initialized (block 416) toselect the first command instruction such as Command Instruction 1, forexample, and if there is an offset (block 417) an offset instructionselection is initialized (block 418) to select the first offsetinstruction such as Offset Instruction 1, for example. It is appreciatedthat data, algorithm, command and offset instruction selection may beinitialized to select another instruction of the respective sequences346, 356, 366, and 376, of instructions, depending upon the particularapplication. Once the initial instruction has been selected for theprogrammable pattern generators 306, 342, 350, 360 and 370, theinstructions may be applied to the appropriate generators of theprogrammable pattern generators 306, 342, 350, 360 and 370 and executed(block 420) to generate the selected address, data, algorithm, commandand offset patterns to generate the appropriate stress tests of thememory 104.

For example, FIG. 3c discussed above depicts a stress test which employsa single command, a write command in this example, which is generated bythe programmable command pattern generator 360 in response to theCommand Instruction 1, in this example. The write command is executedfor each memory cell of the memory region 338, as the programmableaddress pattern generator 306 in response to the Address Instruction 1,in this example, generates a pattern of addresses which walks throughthe memory region 338 as shown, to initialize the memory region 338. Thesame bit (or bits if a multi-bit cell) may be written into each memorycell of the memory region 338, or the bits may vary from cell to cell,as defined by the data pattern generated by the programmable datapattern generator 342 in response to the Data Instruction 1, in thisexample.

In one embodiment, the stress test of FIG. 3c does not employ addressoffsets and accordingly, the programmable offset pattern generator 370may, in response to the Offset Instruction 1, pass the addressesgenerated by the programmable address pattern generator 306 unmodified.In another embodiment, the walking pattern may be generated bysequentially applying column and row offsets to a base address generatedby the programmable address pattern generator 306. Similarly, dependingupon the particular stress test, the programmable algorithm patterngenerator 350, in response to the Algorithm Instruction 1, may pass thewrite data generated by the programmable pattern generator 342unmodified by a particular algorithm.

Once a stress test has been applied to a particular memory region orregions in response to the execution of the initial set of programmablepattern generator instructions, the memory defect detector 220 (FIG. 2)compares (block 422, FIG. 4) the results of the stress test to expectedvalues and identifies defects (if any) in the memory region or regionstested and stores appropriate defect location data in the repair listrepository 224 (FIG. 2) of failing addresses.

As previously mentioned, the self-test logic 110 (FIG. 1) executes anested loop 336 a, 336 b (FIG. 3b ) of offset instructions, nestedwithin the command instruction loop 334. A determination (block 424) ismade as to whether all of the offset instructions of the offsetinstruction sequence 376 (FIG. 3a ) have been selected. If not, the nextoffset instruction, such as Offset Instruction 2, for example, in thesequence 376 of offset instructions is selected (block 426) for theprogrammable offset pattern generator 370. Since the offset instructionloop 336 a, 336 b is nested within the command loop 334, the commandinstruction as well as the algorithm, data and address instructionsremain unchanged at this point. Accordingly, the selected offsetinstruction together with the initial instructions selected for theprogrammable pattern generators 306, 342, 350, and 360 may be applied tothe appropriate generators of the programmable pattern generators 306,342, 350, 360 and 370 and executed (block 420) to generate the selectedaddress, data, algorithm, command and offset patterns to generate theappropriate stress tests of the memory 104.

If it is determined (block 424) that all of the offset instructions ofthe offset instruction sequence 376 (FIG. 3a ) have been selected (andexecuted), a determination (block 430) is made as to whether all of thecommand instructions of the command instruction sequence 366 (FIG. 3a )have been selected. If not, the next command instruction, such asCommand Instruction 2, for example, in the sequence 366 of commandinstructions is selected (block 432) for the programmable commandpattern generator 360. Since the command instruction loop 334 is nestedwithin the algorithm instruction loop 332, the algorithm instruction aswell as the data and address instructions remain unchanged at thispoint. However, the offset instruction selection is reinitialized (block418) to the first instruction of the offset instruction sequence 376(FIG. 3a ). Accordingly, the selected command instruction together withthe initial instructions selected for the programmable patterngenerators 306, 342, 350 and 370 may be applied to the appropriategenerators of the programmable pattern generators 306, 342, 350, 360 and370 and executed (block 420) to generate the selected address, data,algorithm, command and offset patterns to generate the appropriatestress tests of the memory 104.

As previously mentioned, FIG. 3e depicts a multi-part stress test whichemploys a sequence of commands, which may be generated by theprogrammable command generator 360. In part 1 of the stress test of FIG.3e , a single command, in this example, a write command, is executed inresponse to an initial command instruction, such as Command Instruction1, for example, for each memory cell of the memory region 338, as theprogrammable address pattern generator 306 generates in response to aninitial address instruction, such as Address Instruction 1, for example,a pattern of addresses which walks through the memory region 338 asshown, to initialize the memory region 338. Once memory region 338 hasbeen initialized with a write command to each memory cell in part 1 ofthe stress test, a sequence of commands, in this example, a quick readcommand (R) followed by a write inverse (Wbar) command, is executed foreach memory cell of the same memory region 338, as the programmableaddress pattern generator 306 again generates the same pattern ofaddresses generated in part 1, which again walks through the memoryregion 338 a second time as shown for part 2.

In one embodiment, the second sequence of commands (a quick read command(R) followed by a write inverse (Wbar) command) of part 2 may begenerated in response to a second selected command instruction such asCommand Instruction 2, for example, as the programmable address patterngenerator 306 generates in response to the unchanged initial addressinstruction, such as Address Instruction 1, for example, the samepattern of addresses which again walks through the memory region 338 forpart 2 of the stress test. In another embodiment, each command may begenerated in response to a single command instruction.

Following part 2 of the stress test, another sequence of commands, inthis example, a quick read inverse (Rbar) command followed by a write(W) command, is executed for each memory cell of the same memory region338, as the programmable address pattern generator 306 again generatesthe same pattern of addresses generated in parts 1 and 2, which againwalks through the memory region 338 a third time as shown for part 3.Again, in one embodiment, the sequence of commands of part 3 may begenerated in response to a third selected command instruction. Inanother embodiment, the sequence of commands of part 3 may be generatedin response to a single command instruction which also generated thecommands of parts 1 and 2 of the stress test.

FIG. 3d shows an example of a neighbor interaction based address walkingalgorithm stress test as discussed above. To generate the neighborinteraction based address walking algorithm stress test, one or moreoffset instructions may be employed in the sequence 376 of offsetinstructions to generate appropriate offset addresses to address theneighbor cells of the base cell as shown. In addition, one or morecommand instructions may be employed in the sequence 366 of commandinstructions to generate the appropriate sequence of commands for eachneighbor cell as shown.

If it is determined (block 430, FIG. 4) that all of the commandinstructions of the command instruction sequence 366 (FIG. 3a ) havebeen selected (and executed), a determination (block 434) is made as towhether all of the algorithm instructions of the algorithm instructionsequence 356 (FIG. 3a ) have been selected. If not, the next algorithminstruction, such as Algorithm Instruction 2, for example, in thesequence 356 of algorithm instructions is selected (block 436) for theprogrammable algorithm pattern generator 350. Since the algorithminstruction loop 332 is nested within the data instruction loop 330, thedata instruction as well as the address instruction remain unchanged atthis point. However, the command instruction selection is reinitialized(block 416) as well as the offset instruction selection (block 418) tothe first instruction of the respective instruction sequence 366, 376(FIG. 3a ). Accordingly, the next selected algorithm instructiontogether with the initial instructions selected for the programmablepattern generators 306, 342, 350, 360 and 370 may be applied to theappropriate generators of the programmable pattern generators 306, 342,350, 360 and 370 and executed (block 420) to generate the selectedaddress, data, algorithm, command and offset patterns to generate theappropriate stress tests of the memory 104.

If it is determined (block 434) that all of the algorithm instructionsof the algorithm instruction sequence 356 (FIG. 3a ) have been selected(and executed), a determination (block 438) is made as to whether all ofthe data instructions of the data instruction sequence 346 (FIG. 3a )have been selected. If not, the next data instruction, such as DataInstruction 2, for example, in the sequence 346 of data instructions isselected (block 440) for the programmable data pattern generator 342.Since the data instruction loop 330 is nested within the addressinstruction loop 322, the address instruction remains unchanged at thispoint. However, the algorithm instruction selection is reinitialized(block 414) as well as the command selection (block 416) and the offsetinstruction selection (block 418) to the first instruction of therespective instruction sequences 356, 366, 376 (FIG. 3a ). Accordingly,the selected data instruction together with the initial instructionsselected for the programmable pattern generators 306, 350, 360 and 370may be applied to the appropriate generators of the programmable patterngenerators 306, 342, 350, 360 and 370 and executed (block 420) togenerate the selected address, data, algorithm, command and offsetpatterns to generate the appropriate stress tests of the memory 104.

If it is determined (block 438) that all of the data instructions of thedata instruction sequence 346 (FIG. 3a ) have been selected (andexecuted), a determination (block 442) is made as to whether all of theaddress instructions of the address instruction sequence 324 (FIG. 3a )have been selected. If not, the next address instruction, such asAddress Instruction 2, for example, in the sequence 324 of addressinstructions is selected (block 444) for the programmable addresspattern generator 306. The data instruction selection is reinitialized(block 412) as well as the algorithm instruction selection (block 414),command instruction selection (block 416) and the offset instructionselection (block 418) to the first instruction of the respectiveinstruction sequences 346, 356, 366, 376 (FIG. 3a ). Accordingly, theselected address instruction together with the initial instructionsselected for the programmable pattern generators 342, 350, 360 and 370may be applied to the appropriate generators of the programmable patterngenerators 306, 342, 350, 360 and 370 and executed (block 420) togenerate the selected address, data, algorithm, command and offsetpatterns to generate the appropriate stress tests of the memory 104.Once all of the address instructions of the address instruction sequence324 (FIG. 3a ) have been selected (block 442), the test patterngeneration is done (block 450) unless new instructions are loaded intothe sequences 324, 346, 356, 366, 376, and executed, repeating the testpattern generation and execution depicted in FIG. 4.

FIG. 5 depicts one example of defect detection and recording operationsof the defect detector circuit 220 of FIG. 2. The logic depicted in FIG.5 may be implemented in one embodiment, with a hardware finite statemachine on board the die of the memory controller 106. This finite statemachine may in turn be implemented with hardware logic gates or asoftware or firmware programmable processor or a combination thereof onthe same die as the memory controller 104 or other internal die of thedevice 100.

The defect detector circuit 220 detects (block 510) a failure of amemory cell in response to a stress test applied by the test patterngenerator 210 using a stress test pattern generated by the test patterngenerator 210. As described above, a stress test may include memorycommands including read commands, write commands or both, or controlsignals or both, which are applied to the memory 104 or a regionthereof. Data is read from the memory 104 and compared to expectedresults.

The comparison of actual to expected results may indicate a defect in amemory cell. If so, a determination is made as to whether (block 512)the maximum number of defects has already been reached. In oneembodiment, the memory cells may be arranged in a plurality of memoryregions and a fixed number of spare rows of memory cells may beavailable to be substituted for each row of memory cells containing adefective cell. Thus, for a bank of memory cells, for example, there maybe a maximum of two spare rows of cells to available to replace rowshaving defective cells in that particular bank of cells. It isappreciated that the number of spare rows of cells available for aparticular region may vary, depending upon the particular application.Thus, although stress testing and repair is described herein withrespect to rows and banks of memory cells, it is appreciated that stresstesting and repair may be organized at other levels such as on a rankbasis, or chip basis or any memory region or portion thereof.

In some embodiments, the number of spare rows may exceed the number ofrepair list repository locations for storing row addresses of rowscontaining defects, for a particular bank of memory. Accordingly, themaximum number of defects will be equal to the number of spare rowsavailable or the number of repair list repository locations available,whichever is less, for a particular bank of the memory 104.

It is understood that it may not be cost effective in some embodimentsto implement a repair list repository 224 with a relatively large numberof locations for storing the addresses or rows needing repair. Howeverif the number of repairable elements exceeds the number of repair listrepository locations, the test and repair process may be repeated,finding additional failing rows on each iteration, referred to herein astwo pass, three pass or n-pass testing. In this manner it may bepossible to test and repair memory devices with a large number ofdefects, while employing a relatively limited number of repositorylocations.

The number of spare rows (or repair list repository locations) availablefor each bank of the memory 104 may be set by a user setting aconfiguration register 232 (FIG. 2), for example, via the portal 126prior to the initiation of testing. In other embodiments, the number ofspare rows (or repair list repository locations) available for each bankof the memory 104 may be set as a fixed value at the time of manufactureof the device 100.

Thus, a determination may be made as to whether the number of memorylocations such as rows, for example, having at least one defectivememory cell exceeds a maximum for a particular memory region, such as abank of memory cells, for example. In one embodiment, such adetermination may be made by checking a flag (such as a flag of theflags 234 of FIG. 2, for example) which when set, indicates that thefailure maximum has been reached. Thus, upon detecting (block 510) adefective memory cell, it may be determined whether (block 512) themaximum number of defects has already been reached for the region inwhich the defect was found, by checking the status of the failuremaximum flag for that region. If the maximum has already been reachedsuch that the additional defect exceeds the maximum, the detection andrecording process is ended (block 514) for that particular defect.

In this manner, the failure maximum flag provides an overflow indicatorwhich indicates whether additional repair is possible for a particularbank. In one embodiment, stress testing of a bank may continue after thefailure maximum flag has been set to determine whether additionaldefects exist in that bank notwithstanding that additional spare rows(or additional repair list repository locations) are not available foruse in connection replacement of any such additional defects. Ifappropriate, a failure maximum flag may be reset by a write operation toa configuration register of the flags 234 via the portal 126 or by anexplicit reset operation.

If the maximum number of defects has not been exceed, a determination ismade as to whether (block 518) the row of the defective memory cell isnew, that is, whether the defective memory cell is the first knowndefective memory cell of a set of memory locations such as a row ofmemory cells, for example. As previously mentioned, in the illustratedembodiment, the memory may be repaired by replacing a row of memorycells containing a defective cell with an entire row of spare cells.Hence, if the row is not new and unique, that is, it has already beendesignated for replacement, then the defect is not the first defectdiscovered for that row, and the detection and recording process isended (block 514) for that particular defect.

As explained below, a row or other set of memory locations containing adefective memory cell may be designated for replacement in a memoryconfigured as a repair list repository, such as the repair listrepository 224 (FIG. 2) of failing memory addresses. In such anembodiment, it may be determined as to whether (block 518) the defectivememory cell is the first known defective memory cell of a row of memorycells, for example, by determining if the row of memory cells containingthe defective memory cell of a particular memory region of memory cells,has already been stored as an entry in the list of the repair listrepository 224. If so, the defective memory cell is determined to not bethe first known defective cell of that row, and storing a designation ofthat row containing the defective memory cell in the repair listrepository as an entry of the list of memory locations may be bypassed(block 514), since the particular row of memory cells of the particularmemory region of memory cells has already been stored as an entry in thelist of the repair list repository.

If it is determined (block 518) that the defective memory cell is thefirst known defective memory cell of a set of memory locations such as arow of memory cells, for example, a determination may be made as towhether the number of memory locations such as rows, for example, havingat least one defective memory cell has reached (block 520) the maximumfor a particular memory region, such as a bank of memory cells, forexample. If so, the aforementioned failure maximum flag may be set(block 524) and the detection and recording process is ended (block 514)for that particular defect. In one embodiment, the failure maximum maybe set to indicate when the supply of spare rows available forreplacement of defective rows has been exhausted for a particular memoryregion.

If the failure maximum has not been reached, indicating that additionalspare rows are available for use as replacement for defective rows for aparticular memory region, a determination is made as to whether (block530) there have been prior failures of other rows detected. If so, acounter representing a failure count is incremented (block 532). Thisfailure count may be compared to the failure maximum in a subsequentdetermination (block 520) to determine if the number of failuredetections has reached the failure maximum.

The row address of the row containing the defective memory cell may bestored (block 534) in an appropriate location of the repair listrepository 224 (FIG. 2) of failing addresses and a flag set (block 540)indicating that the address of a row of memory cells has been stored inthe repair list repository 534 for repair of that row. This flag may bechecked in a subsequent determination (block 530) as to whether therehave been prior failures detected for that memory region. In oneembodiment, a flag may be set for each memory region, indicating whetherat least one row of the particular memory region has at least onedefective memory cell.

FIG. 6 shows one example of repair list repository 224 of failing memoryaddresses. In this example, the structure of the repair list repository224 has been arranged as an array of rows and columns of repositorylocations, in which each bank, Bank 0, Bank 1 . . . Bank n, of thememory 104 has an assigned row of repository locations. The array of therepair list repository 224 has a column of locations, Fail 0, Fail 1, .. . Fail n, for each spare memory row available to be assigned toreplace a row of a particular bank of memory cells. Thus, if aparticular memory has eight banks, for example, and four spare rows ofmemory cells, for example, for each bank, the repair list repository 224would have eight rows of repository locations, one row of repositorylocations for each bank, and four columns of repository locations, onecolumn of repository locations for each available spare row of memorycells for that particular bank.

Accordingly, upon detection (block 510, FIG. 5) of the first defectiverow of a particular bank, such as Bank 0, the row address of the memorycell row of Bank 0 containing the defective memory cell may be placed inthe repair list repository location, Bank 0, Fail 0, and a flag may beset (block 540) in the Bank 0 Flags location of the repair listrepository 224, indicating that the address of a row of memory cells hasbeen stored in the repair list repository 534 for repair of that memorycell row in Bank 0. Upon detection (block 510, FIG. 5) of the next new,unique defective memory cell row of Bank 0, the failure count isincremented (block 532) to point to repository location Bank 0, Fail 1,the next location in the row of repository locations for Bank 0, and thememory cell row address of that next new, unique row of Bank 0containing the defective memory cell may be placed in the repair listrepository location at Bank 0, Fail 1. In addition, a flag may be set(block 540) in the Bank 0 Flags location of the repair list repository224, indicating that another address of a row of memory cells has beenstored in the repair list repository 534 for repair of that memory cellrow in Bank 0.

Upon each subsequent detection of a new, unique row of memory cells ofBank 0 containing a defect, the failure count is incremented (block 532)to point to the next repository location in the row of locations forBank 0, and the memory cell row address of that next unique memory cellrow of Bank 0 containing the defective memory cell may be placed in therepair list repository location corresponding to that failure count. Inaddition, a flag may be set (block 540) in the Bank 0 Flags location ofthe repair list repository 224, indicating that another address of amemory cell row of memory cells has been stored in the repair listrepository 534 for repair of that row in Bank 0.

Stress testing of Bank 0 continues until all of that bank has beenstress tested with each of the programmed stress tests. As the stresstesting of Bank 0 progresses, once the number of detected new, uniquerows containing a defect exceeds the number of spare rows for Bank 0,the failure maximum is reached (block 520), and the failure maximum flagmay be set (block 524) in the Bank 0 Flags location in the repair listrepository 224. At that point, no additional memory cell row addressesare recorded (block 514) in the repair list repository since noadditional spare rows remain for Bank 0. However, stress testing of Bank0 may continue, in one embodiment, even after the failure maximum isreached, to identify whether additional defects exist in Bank 0. Inother embodiments, stress testing of a particular bank may be terminatedonce the failure maximum has been reached.

Upon termination of stress testing and defect recordation in the repairlist repository 224 for Bank 0, the failure count as indicated by thefailure counter may be reset either automatically or by a user orexternal software resetting the failure counter prior to the initiationof testing of the next bank of the memory 104. In one embodiment, thefailure counter may be maintained as a register in the flags 234 andaccessed via the portal 126 to be read or reset as appropriate. Also, insome embodiments, a separate failure counter may be maintained for eachbank or other memory region of the memory 104.

Stress testing of the memory 104 continues, stress testing the remainingbanks, Bank 1, Bank 2 . . . Bank n, wherein the memory cell rowaddresses of new, unique memory cell rows containing defects arerecorded in the repair list repository 224 in a manner similar to thatdescribed above for Bank 0. In addition, flags may be set for each bankas stress testing progresses for each bank, as described above.

Once at least one memory cell row address of a row of memory cellscontaining a defect has been recorded in the repair list repository 224,the self-repair logic 114 (FIG. 1) may automatically commence repairingthe defective memory 104 by replacing the row of cells containing adefect, with a spare row of memory cells, without user or externalsoftware intervention. In one embodiment, the self-repair logic 114 mayoperate in parallel with the self-test logic 100 such that the memory104 may be repaired in parallel with ongoing stress testing of thememory to identify additional rows if any containing a defective memorycell.

Thus, in one embodiment, the repair logic may be activated once allstress tests are complete and all defective memory cells rows have beenrecorded in the repository 224. In another embodiment, the repair logicmay be activated once all stress tests are complete for a particularmemory region such as a bank, for example, and all defective memorycells rows have been recorded in the repository 224 for that bank. Assuch, stress tests may be resumed to identify any memory defects in onebank while defective memory cell rows already recorded in the repairlist repository 224 are repaired for another bank. In yet anotherembodiment, the repair logic may be activated to repair memory cell rowsas soon as defective memory cell rows are recorded in the repair listrepository without waiting for stress testing to be completed for aparticular memory region such as a bank, for example.

It is appreciated that the contents of the repair repository, includingthe addresses of rows with at least one defective cell and theassociated flags may be read out by hardware or software and saved forlater use in repair. As described above the repair may be conducted asfailures are detected, or after all stress tests have completed. Inaddition the repair may be deferred to a later time in the same teststep or even to some other future test step. If the repair data isstored in volatile registers it may be required to copy the data to someother permanent storage, either on-die or off-die, such as over anetwork or storage device before removing power from the repository 224.Storing the repair data in this way may not only facilitate deferredrepair but may also serve as a permanent record of failure rates such asmight be employed in process tracking for quality management or otherpurposes.

FIG. 7 illustrates a more detailed example of the self-repair logic 114of FIG. 1, in accordance with one embodiment of the present description.In this example, the logic depicted in FIG. 7 is a repair engineimplemented in one embodiment, with a hardware finite state machine onboard the die of the memory controller 106. This finite state machinemay in turn be implemented with hardware logic gates or a software orfirmware programmable processor or a combination thereof on the same dieas the memory controller 104 or other internal die of the device 100.

As explained in greater detail below, the repair logic 114 cyclesthrough the list of failing addresses collected by the self-test logic110 and recorded in the repair list repository 224. For each failingmemory cell row, the row address of which is recorded in a repositorylocation of the repository 224, the repair logic 114 issues appropriatecommands to the memory 104 to replace the failing or failed row with aspare row built into the memory 104.

In a first state 710, the state machine of the repair logic 114 is idle,awaiting recordation of a row address of a defective memory cell row inthe repair list repository 224. Upon recordation of at least one rowaddress of a defective memory cell row in the repair list repository224, the state machine automatically issues a precharge command (state714) to precharge the memory region or regions containing the defectivememory cell rows as identified in the repair list repository 224.Following a wait state 720 to allow the precharge to complete, the statemachine automatically enables (state 724) the repair mode of the memory104, initiates (state 730) the repair of a memory cell row as identifiedby a location recorded in the repair list repository 224, and enters await state 734 to allow sufficient time for the repair of that memorycell row to be completed.

In one embodiment, the state machine of the repair logic 114 includes asuitable timer circuit for the wait state 734. For example, aprogrammable delay/counter may be provided to allow sufficient time(such as 200 milliseconds, for example) for the repair to complete. Insome embodiments, the counter may have up to 20 bits depending on theinput clock frequency. To reduce the size of the counter circuitry, itmay be appropriate in some embodiments to have a two stage counter whichincludes a fixed counter/divider with an output timing granularity ofapproximately 2 to 5 milliseconds and a programmable 6 to 8 bit counter.It is appreciated that other timer designs may be employed, dependingupon the particular application.

In one embodiment, the state machine of the repair logic 114 may issueappropriate Post Package Repair (PPR) commands in accordance with theJEDEC (JEDEC Solid State Technology Association, formerly known as theJoint Electron Device Engineering Council) protocols. In response to thecommands, fuses are opened or closed as appropriate to remove thedefective memory cell row from the memory array and add a spare memorycell row in circuit to the array to substitute the spare memory cell rowfor the defective row. It is appreciated that other repair commands andprotocols may be utilized, depending upon the particular application.

Upon expiration of the wait state 734, another precharge command (state740) may be issued followed by another wait state 744 to allow theprecharge to complete. The cycle of state machine states 730-744 isautomatically repeated for each additional row address recorded in therepair list repository 224 until all defective memory cell rowsidentified in the repair list repository 224 have been replaced by sparememory cells of the associated bank.

Once all defective memory cell rows identified in the repair listrepository 224 have been replaced by spare memory cells of theassociated bank, the state machine of the repair logic 114 exits (state750) the repair mode, waits (state 754) for the exit to complete, andthe repair operations are complete. A flag bit of the flags 234 may beset to indicate that all repairs have been done. This flag bit may bepolled internally or by external test equipment or software, todetermine when the repairs have been completed.

In one embodiment, suitable instruction sequences may be loaded intoappropriate configuration registers 232 (FIG. 2) or other memory of theself-test logic 110 (FIG. 1) via the portal 126. Such loading operationmay be performed automatically by logic on board the computerarchitecture device 100. In other embodiments, devices or softwareexternal to the computer architecture device 100 may be employed to loadsuitable instruction sequences into the self-test logic 110. In thismanner, the instruction sequences may be changed as appropriate tofacilitate changing stress test patterns. In still other embodiments,suitable instruction sequences may be fixed into the logic of theself-test logic 110. Whether instruction sequences are fixed orchangeable, it is appreciated that the nested loop structure ofinstruction sequences described herein may facilitate readily adaptingthe self-test logic 110 to conduct a wide variety of stress tests.

In one embodiment, hardware configuration registers 232, registers ofthe flags 234 and the repair list repository 224 are accessible in asystem Peripheral Component Interconnect (PCI) or PCI Expressconfiguration space or from a Test Access Port (TAP) controller.Configuration space registers may be mapped to memory locations. Devicedrivers and diagnostic software may have access to the configurationspace, and the operating system may use Application ProgrammingInterfaces (API's) to allow access to the device configuration space. Inthose embodiments, in which the operating system does not have accessmethods defined or API's for memory mapped configuration space requests,the driver or diagnostic software accesses the configuration space in amanner that is compatible with the operating system underlying accessrules. In other embodiments the hardware configuration registers may beaccessed through some other interface or an existing interface adaptedfor the purpose of accessing hardware configuration registers.

In the illustrated embodiment, the flags 234 including the failurecounter may be implemented with a single register or adjacent registers,to facilitate allowing all status bits for a channel to be read with asfew as a single TAP operation. Thus, in one embodiment, the registersfor a 4 bank, 4 row repair engine of the self-repair logic circuit 114may occupy 20 bits, for example, for the flag bits, plus the number ofbits implementing the delay register of the finite state machine of theself-repair logic circuit 114.

As previously mentioned, the internal defect detection and repaircircuit 108 may interrupt normal memory transactions between theprocessor 102 and memory 104 to conduct memory test and repairoperations. For example, the defect detection and repair circuit 108 maybe invoked as part of a boot process executing a (Basic Input and OutputSystem (BIOS) boot process of the computer architecture device 100.

FIGS. 8a-8g show an example of an address generator 800 of the addressgenerators 310 a, 310 b . . . 310 n of FIG. 3. In this example, theaddress generator 800 is a configurable pipeline address generatorhaving a plurality of pipeline stages, n00 and n01, for example. Asexplained in greater detail below, the address generator 800 is believedcapable of rapidly generating addresses for stress testing the memory104. For example, to excite neighboring interaction of charge couplingto detect failure, it is preferable to generate back to back memorytransactions without excessive delay from the self-test logic 110 (FIG.1). Although the pipeline address generator 800 is depicted as havingtwo pipestages n00, n01, is it appreciated that a pipeline addressgenerator may have more or fewer pipestages, depending upon theparticular application.

Also, in this example, the pipeline address generator 800 isconfigurable into a plurality of configurations 804 a, 804 b . . . 804g, depicted in FIGS. 8a-8g , respectively. A particular configurationmay be selected by an address instruction, for example, of the addressinstructions 1, 2, . . . n, of the sequence 324 (FIG. 3a ) of theinstruction loop 322 (FIG. 3b ), for example. In the illustratedembodiment, each configuration 804 a, 804 b . . . 804 g generatesaddresses in a particular address order of the hierarchical structure ofthe memory 104. As previously mentioned, a memory region of rows andcolumns of memory cells may be referred to as a bank. The memory 104 mayhave a plurality of integrated circuit memory chips, in which a group ofintegrated circuit memory chips is often referred to as a rank. In thisembodiment, each rank of the memory 104 has a rank address and comprisesa plurality of banks of memory cells on one or more dies. However, thememory 104 may in some embodiments, have a hierarchical structure whichlacks ranks or may have one or more ranks on the same die.

Each bank of a rank of banks in turn has a bank address and comprises amemory region of a plurality of rows and column of memory cells arrangedin an array. Thus, the full address of each memory cell of the memory104 includes a rank address, bank address, row address and columnaddress. However, it is appreciated that in some embodiments, a fulladdress may lack a rank address, for example.

The pipeline address generator 800 may be configured to generate thefull address of a memory cell in different address orders, dependingupon the configuration selected for the generator 800. Thus, thepipeline address generator 800 generates row, column, bank and rankaddresses in a particular address order. By altering the address orderin which the parts of the full address are generated, the path of thegenerated addresses through the memory 104 is correspondingly altered.Thus, parameters of the address instruction may include address order.It is appreciated that other parameters may be included or utilized,depending upon the particular application.

In one example, the configuration 804 a of the pipeline addressgenerator 800 depicted in FIG. 8a , sequentially generates memoryaddresses sequentially in a first address order of rank, bank, row andcolumn which defines the order in which addresses are sequentiallygenerated by rank, bank, row and column as shown in FIG. 9a . In theconfiguration 804 a, the pipeline address generator 800 has a columnaddress generator 810 a in the lowest address order slot, addressorder0,of the first pipestage n00 and a row address generator 810 a in the nextlowest address order slot, addressorder1, of the second pipestage n01.Thus, after initializing the rank, bank, row and column addresses(blocks 912-918, FIG. 9a ) and outputs (block 920) the first fulladdress, the pipeline address generator 800 increments the columnaddress to generate (block 924) the next column address with the columnaddress generator 810 a of the first pipestage n00, to traverse in acolumn loop 926 nested in a row loop 927, the generated full addressesacross the columns of memory cells of a particular row of a particularbank of a particular rank, before the row address generated by the rowaddress generator 810 a of the second pipestage n01 changes in the rowloop 927. Once traversal of the columns has been completed (block 928)in the column loop 926, the pipeline address generator 800 increments inthe row loop 927, the row address to generate (block 930) the next rowaddress generated by the row address generator 820 a of the secondpipestage n01 and resets (block 918) the column address, to traverse thegenerated full addresses again across the columns of memory cells of thenext row of a particular bank of a particular rank, before the rowaddress generated by the row address generator 810 a of the secondpipestage n01 again changes (block 930) in the row loop 927.

In this manner, the pipeline address generator 800 generates fulladdresses of memory cells to traverse the generated full addressesacross the columns and rows of a particular bank of memory cells in acolumn, row address order. In the configuration 804 a, the pipelineaddress generator 800 has a bank address generator 824 a in the secondto highest address order slot addressorder2 of the second pipestage n01and a rank address generator 828 a in the highest address order slot,addressorder2 of the second pipestage n01. Thus, the column loop 926 isnested in the row loop 927 which in turn is nested in a bank loop 931.The bank loop 931 is in turn nested in a rank loop 933.

Thus, once traversal of the rows (and columns) has been completed (block932) in the nested column and row loops for a bank, the pipeline addressgenerator 800 increments in the bank loop 931, the bank address togenerate (block 934) the next bank address generated by the bank addressgenerator 824 a of the second pipestage n01 and resets the row address(block 916) and the column address (block 918), to traverse thegenerated full addresses across the next bank of memory cells of aparticular rank, in the manner described above in the nested column loop926 and row loop 927 before the rank address generated (block 938) bythe rank address generator 828 a of the second pipestage n01 changes.Once the traversal of all the banks of the particular rank has beencompleted (block 936), the pipeline address generator 800 increments inthe rank loop 933, the rank address to generate (block 938) the nextrank address generated by the rank address generator 828 a of the secondpipestage n01 and resets (block 914) the bank address, row address(block 916) and column address (block 918), to traverse the generatedfull addresses again across each of the banks of memory cells of thenext rank, in the manner described above in the nested column loop 926,row loop 927 and bank loop 931, before the rank address generated by therank address generator 828 a of the second pipestage n01 again changes(block 938). Once the traversal of all the ranks of the selected memoryregion has been completed (block 940), the traversal of the selectedmemory region has been completed (block 944). In this manner, thepipeline address generator 800 generates full addresses of memory cellsto traverse the generated full addresses across the columns and rows ofeach bank of each rank of memory cells of the selected memory region, inthe address order of rank, bank, row and cell of the configuration 804 aof FIG. 8 a.

In another example, the configuration of configuration 804 a may bemodified from that depicted in FIG. 8a , to generate memory addressessequentially in a different address order of rank, bank column and row,for example as shown in FIG. 8g and FIG. 9b . In this modifiedconfiguration 804 g, the pipeline address generator 800 has a rowaddress generator 820 g in the lowest address order slot addressorder0of the first pipestage n00 and a column address generator 810 g in thenext lowest address order slot, addressorder1, of the second pipestagen01. The positions of the rank address generator 828 g and the bankaddress generator 824 g are unchanged. Thus, in FIG. 9b , the row loop927 is nested in the column loop 926, which is nested in a bank loop931, which is in turn nested in a rank loop 933.

As shown in FIG. 9b , the pipeline address generator 800 of thismodified configuration increments (block 930) the row address generatedby the row address generator 820 g of the first pipestage n00, totraverse the generated full addresses across the rows of memory cells ofa particular column of a particular bank of a particular rank, beforethe column address generated by the column address generator 810 g ofthe second pipestage n01 changes (block 924).

In another example, the configuration of configuration 804 a may bemodified from that depicted in FIG. 8a , to generate memory addressessequentially in a different address order of rank, row, column and bank,for example as shown in FIGS. 8b and 9c . In this modified configuration804 b, the pipeline address generator 800 has a bank address generator824 b in the lowest address order slot, addressorder0, of the firstpipestage n00, a column address generator 810 b in the next lowestaddress order slot, addressorder1, of the first pipestage n00, a rowaddress generator 820 b in the second highest address order slotaddressorder1 of the second pipestage n01 and a rank address generator828 b in the highest address order slot, addressorder2, of the secondpipestage n01. Thus, the bank loop 931 is nested in the column loop 926,which is nested in the row loop 927 which in turn is nested in a rankloop 933 of FIG. 9 c.

The pipeline address generator 800 of this modified configurationincrements in bank loop 931, the bank address of a particular fulladdress to generate (block 934) the next bank address generated by thebank address generator 824 b of the first pipestage n00, to traverse inbank loop 931, the generated full address at a particular column addressand row address across the banks of memory cells of a particular rank,one memory cell per bank, before the column, row and rank addressesgenerated by pipeline address generator 800 changes. Once the generatedfull address is traversed across the banks of memory cells of theparticular rank, the column address (the next higher address order) isincremented in the column loop 926, to generate (block 924) the nextcolumn address with the column address generator 810 b of the firstpipestage n00. The bank address is reset (block 914), and the banktraversal process of bank loop 931 repeated, traversing that fulladdress with the incremented column address (and unchanged row and rankaddresses), across the banks of memory cells in the bank loop 931, onememory cell per bank, of the particular rank, until the memory cells ofthe incremented column address (and unchanged row and rank addresses),of the banks have been traversed.

Once a generated full address has been incremented for each column andtraversed (block 940) across the banks of memory cells of the particularrank, one memory cell per bank, for each bank and column, such thattraversal of the columns has been completed (block 928) in the columnloop 926, the bank (block 914) and column (block 918) addresses arereset and the row address (the next higher address order) is incrementedin row loop 927 to generate (block 930) the next row address with therow address generator 820 b of the second pipestage n01. The bank,column ordered traversal process of bank loop 931 nested in column loop926 to traverse the banks in bank loop 931 one column at a time asdescribed above, is repeated for the incremented row, traversing thefull address with the incremented row address (and with unchanged rankaddress) in the row loop 927, across the banks in bank loop 931 onecolumn at a time, and incrementing in column loop 926, the columnaddress each time the banks of the particular rank are traversed in thebank loop 931.

Thus, once traversal of the rows (and columns and banks) has beencompleted (block 932) in the nested bank, column and row loops for arank, the pipeline address generator 800 increments in the rank loop933, the rank address to generate (block 938) the next rank addressgenerated by the rank address generator 828 b of the second pipestagen01 and resets the row address (block 916), column address (block 918),and bank address (block 914) to traverse the generated full addressesagain across each of the banks of memory cells of the next rank, in themanner described above in the nested bank loop 931, column loop 926, androw loop 927, before the rank address generated by the rank addressgenerator 828 a of the second pipestage n01 again changes (block 938).Once the traversal of all the ranks of the selected memory region hasbeen completed (block 940), the traversal of the selected memory regionhas been completed (block 944). In this manner, the pipeline addressgenerator 800 generates full addresses of memory cells to traverse thegenerated full addresses across the columns and rows of each bank ofeach rank of memory cells of the selected memory region, in the addressorder from lowest to highest of bank, column, row and rank of theconfiguration 804 b of FIG. 8b and FIG. 9 c.

FIGS. 8c-8f show examples of other configurations 804 c-804 f of theaddress generators 310 a, 310 b . . . 310 n of FIG. 3a , to generatememory addresses sequentially in a different address orders as shown. Inthese other configurations, the pipeline address generator 800 has arank address generator 828 c-f, a bank address generator 824 c-f, a rowaddress generator 820 c-f and a column address generator 810 c-farranged in a pipestage n00, n0a and in an address order slotaddressorder3-0, as shown. For example, in the configurations of FIGS.8a, b, and e bank addresses are sequentially incremented to the nextbank address in sequence of the device before a rank address isincremented to the next rank address of the device in sequence.Conversely, in the configurations of FIGS. 8c, d and f , rank addressesare sequentially incremented to the next rank address of the device insequence before a bank address is incremented to the next bank addressof the device in sequence. It is appreciated that other configurationsand other address orders may be utilized, depending upon the particularapplication.

In generating addresses to traverse through the memory 104, it isappreciated that address portions such as row addresses, columnaddresses, bank addresses and rank addresses, for example, may beincremented by a positive or negative amount, depending upon theselected traversal direction (for example, north, south, east, west,(FIG. 3c )) of the selected traversal pattern. It is further appreciatedthat address portions may be incremented (positively or negatively) bymore than one applicable unit such as a cell, bank or rank unit, to skipcells, banks or ranks, depending upon the particular walking patternselected. Moreover, the incremental amount may vary rather than beingfixed in some traversal patters. A traversal pattern including theparameters defining the traversal pattern may be selected by an addressinstruction, for example, of the address instructions 1, 2, . . . n, ofthe sequence 324 (FIG. 3a ) of the instruction loop 322 (FIG. 3b ), forexample, applied to a selected address generator.

FIG. 8h shows an example of the offset address generators 374 a, 374 b .. . 374 n of FIG. 3a . In this example, the offset address generator isa configuration 8 h of an address generator 800 previously described forthe address generators 310 a, 310 b . . . 310 n of FIG. 3d . Theconfiguration 804 h of the pipeline address generator 800 depicted inFIG. 8h , sequentially generates memory addresses offset from the basein the neighbor traversal pattern depicted in FIG. 9a . In theconfiguration 804 a, the pipeline address generator 800 has a columnaddress generator 810 h in the lowest address order slot addressorder0of the first pipestage n00 and a row address generator 810 h in the nextlowest address order slot, addressorder1 of the second pipestage n01.The rank and bank addresses are provided by the base address and thusremain unchanged for each base address.

In the neighbor traversal pattern depicted in FIG. 3d , four offset fulladdresses are generated by incrementing the column address of the baseaddress, in the row address of the base address, first in one directionand then reversing to the opposite direction. Similarly, an additionalfour offset full addresses are generated by incrementing the row addressof the base address, in the column address of the base address, first inone direction and then reversing to the opposite direction. Tofacilitate rapid column or row address generation, the positions of therow address and column address generators may be reconfigured from theconfiguration depicted in FIG. 3h to be reversed as appropriate.

In accordance with another aspect of the present description, thepipeline address generator 800 has a carry count generator such as thecarry count generators 814 a-g of the configurations 804 a-g,respectively. In the illustrated embodiment, one or more of theaddresses generated by the corresponding address generators of thepipeline address generator 800 are a function of the output of the carrycount generator which is 814 a-g which performs a look ahead functionfor the address carry of addresses being generated.

For example, in the address order of the configuration of FIG. 8a ,following generation of the last row address, the bank addressincrements to the bank address of the next bank of the sequence of theselected walking pattern. However, in embodiments in which an addresssuch as a row or column address is generated by an address generatorhaving a large counter having 32 bits or 64 bits, for example, it isappreciated that generation of an address carry by such a generator maytake a correspondingly large amount of time.

FIGS. 10 and 11 are directed to another aspect of the presentdescription. In the illustrated embodiment, the pipeline addressgenerator is responsive to a clock signal described in the operations ofFIG. 10 and as schematically represented by the clock signal 910 of FIG.11, to produce a full address including rank, bank, column and rowaddresses every clock signal after an initial startup period. Becausethe carry count generator 814 a of the pipestage n00 performs a lookahead function for the address carry of addresses being generated, theoutput of the carry count generator 814 a of the pipestage n00 may bevalid in an initial part (schematically represented by the clockinterval A1 in FIG. 9) of each clock signal clock1, clock2 . . . clock nafter the initial startup period. By providing a valid address carryoutput prior to or relatively early in the clock cycle, the address oraddresses such as the bank address which is a function of an addresscarry, may also be valid in the next clock cycle in an interval of eachclock (schematically represented by the clock interval A2 in FIG. 9)which may be the same, different or overlapping interval A1. As aresult, the next full address output is valid in a part of each clocksignal (schematically represented by the clock interval B1 in FIG. 9)following the interval A2 after the initial startup period. Accordingly,after the startup initialization period 1114, the pipeline addressgenerator 800 can produce a full address in sequence in each interval B1of each clock cycle, clock1, clock2, etc.

FIG. 10 illustrates operations of pipestages of a configurable addressgenerator such as the address generator 800 of FIGS. 8a-8h , forexample. In a first operation, the address generator is configured(block 1010) for a particular address order, such as the address orderrank, row, column and bank addresses, of FIG. 8b , for example, of afull address. Such configuration may be provided by an addressinstruction, for example. In the example of FIG. 10, the addressgenerator is configured as in FIG. 8 a.

In addition, the generator is configured (block 1014) for a selectedmemory region. Such configurations parameters may be provided by anaddress instruction, for example, and may define the size of the memoryregion to be traversed in terms of number of ranks, banks, columns, rowsetc. and include a starting address, for example. Following a startupperiod (block 1018) such as the startup period 1114 (FIG. 11), the firstfull address may be output in a clock cycle interval such as theinterval B1 (FIG. 11) of the clock clock1, for example.

Following the startup period, a pipestage such as the pipestage n00, forexample, over the course of a clock cycle, increments (block 1026) andoutputs the column address in the address order of the configuration ofconfiguration 804 a (FIG. 8 a), and the column and row combined carryout count of the carry counter generator 814 b. Over the course of thenext clock cycle, a pipestage such as the pipestage n01, for example,updates and outputs (block 1034) the row address, bank address and therank address. The row address, bank address and the rank addressgenerated by the pipestage n01 are a function of the column and rowcombined carry out count generated by the pipestage n00 in the priorclock cycle. While the row address, bank address and the rank addressare being generated for one full address by the pipestage n01, thepipestage n00 is generating in the same clock cycle, the column and rowcombined carry out count as well as the column address for the next fulladdress. Thus, to generate a full address, takes two clock cycles.However, because the pipestages n00 and n01 operate in parallel, a fulladdress is output each clock cycle. In one embodiment, the output of theaddress carry count generator of the first pipeline stage is valid ineach clock signal after the initial startup period, and the next fulladdress is valid in a subsequent part of each clock signal after theinitial startup period.

If (block 1036) the last full address of the selected memory region hasnot been generated and output, the operations of block 1026-1036 arerepeated for the next clock cycle, such as clock3, for example. In thismanner, a full address is generated and output for each clock cycle,following the startup period. Once (block 1036) all the addresses of theselected memory region have been generated, the process ends (block1040) for that portion of the stress tests.

FIG. 12 shows one example of a programmable algorithm pattern generatorof the generators 354 a-n in accordance with one aspect of the presentdescription. The programmable algorithm pattern generator of FIG. 11 isa variable refresh signal generator 1210 for generating, in response toan algorithm instruction such as one of the algorithm instructions 1, 2,. . . n (FIG. 3a ) of the sequence 356 of the algorithm instruction loop332 (FIG. 3b ), a refresh signal for the memory cells of the memory 104,wherein the refresh signal has a variable refresh rate.

In the illustrated embodiment, the memory 104 is a dynamic random accessmemory (DRAM) in which bits are stored as charges on a node capacitance.In a DRAM, a bit cell typically loses charge over time. To prevent lossof data stored in the memory, the memory controller for a DRAMperiodically issues a refresh signal to all the rows within an allowedrefresh time to restore the charge (and retain the data stored) withineach cell.

If the memory cells are refreshed too infrequently, data may be lost. Ifthe memory cells are refreshed too frequently, energy may be wasted andmay lead to premature battery exhaustion in portable devices.Accordingly, the variable refresh signal generator 1210 may beprogrammed to generate a refresh signal at various refresh rates, bothwithin and without an expected refresh rate of the memory specification,to test for defective cells and to determine whether the memory may berefreshed at a rate below specification and yet retain the stored data.

In one embodiment, the variable refresh signal generator 1210 may beprogrammed to generate refresh signals in a declining sequence ofrefresh rates for refreshing memory cells at each rate of the decliningsequence of refresh rates. Each refresh rate of the declining sequencemay be reduced by an amount from the rate of the prior refresh rate ofthe declining sequence of refresh rates. In this manner, the memorycells may be refreshed at declining refresh rates until memory defectsor data loss is detected.

In one embodiment, the refresh rate may be varied by varying thefrequency of refresh signals as the test progresses. In anotherembodiment, the duty cycle of refresh pulses of refresh signals may bevaried as the test progresses. It is appreciated that refresh signalsmay be programmed to vary in other respects, depending upon theparticular application. In another aspect, varying the refresh rate maybe combined with various other stress tests in which memory commands ofvarious memory command patterns, are issued to memory cells addressed byvarious memory address traversal patterns as the refresh rate is varied.

In one embodiment, the variable refresh signal generator 1210 may beprogrammed or configured by algorithm instruction such as one of thealgorithm instructions 1, 2, . . . n (FIG. 3a ) of the sequence 356 ofthe algorithm instruction loop 332 (FIG. 3b ), for example, to providerefresh signals at a programmed rate.

The data input and modified by the variable refresh signal generator1210 to generate a refresh signal at various refresh rates, may beprovided by the programmable data pattern generator 342. In otherembodiments, the input signal may be self-generated by the variablerefresh signal generator 1210. In one embodiment, the output of thegenerator 1210 is an alternate data source which may be selected by aparameter of a command instruction.

FIG. 13 shows another example of an algorithm generator 1310 of thealgorithm generators 354 a, 354 b . . . 354 n (FIG. 3a ), of theprogrammable algorithm pattern generator 350, of the test patterngenerator 210. The algorithm generator 1310 of this embodiment includesa pattern sequencer 1314 a, 1314 b, 1314 c, each having an output, S0,S1, S2, respectively, coupled to the selector inputs 1318 of one or moremultiplexers 1322 a, 1322 b, . . . 1322 n. Each multiplexer 1322 a, 1322b, 1322 n has inputs coupled to a memory such as a register or cache1324, for example, storing pattern mixer data which may be generated andstored in the cache 1324 by the programmable data pattern generator 342(FIG. 3a ), for example. Each multiplexer 1322 a, 1322 b, . . . 1322 nis adapted to select a multiplexer input to output a bit of the patternmixer data to a multiplexer output, in response to the selection signalsS0, S1, S2, of the pattern sequencers 1214 a, 1314 b, 1314 c,respectively. The data output by each multiplexer 1322 a, 1322 b, . . .1322 n may be used as a control signal to stress test the memory 104 ascommands are executed at addresses traversing the memory 104. Also, thedata output by each multiplexer 1322 a, 1322 b, . . . 1322 n may be usedas write data to stress test the memory 104 as commands are executed ataddresses traversing the memory 104. Still further, the data output byeach multiplexer 1322 a, 1322 b, . . . 1322 n may be used as expectedtest result data to compare to actual test data obtained as the memory104 is stress tested. In one embodiment, the output of the generator1310 is an alternate data source which may be selected by a parameter ofa command instruction. Similarly, in one embodiment, the output of apattern sequencer 1314 a, 1314 b, 1314 c is an alternate data sourcewhich may be selected by a parameter of a command instruction.

In the illustrated embodiment, the pattern sequencers 1214 a, 1314 b,1314 c, are each programmable to output various patterns of multiplexerselection signals S0, S1, S2. In one embodiment, the pattern sequencers1214 a, 1314 b, 1314 c may be programmed by the sequential loop 332(FIG. 3b ) of algorithm instructions in the sequence 356 (FIG. 3a ) ofalgorithm instructions, Algorithm Instruction 1, Algorithm Instruction 2. . . Algorithm Instruction n. Each algorithm instruction, AlgorithmInstruction 1, Algorithm Instruction 2 . . . Algorithm Instruction n, ofthe sequence 356 when executed by an appropriate one of the patternsequencers 1214 a, 1314 b, 1314 c, causes that pattern sequencer 1214 a,1314 b, 1314 c to generate a multiplexer select signal pattern as afunction of the particular algorithm instruction.

In another aspect of the algorithm generator 1310, the pattern mixerdata which is generated and stored in the cache 1324, may remain static,that is unchanged, over the course of a particular stress test. FIG. 14is a table depicting examples of various Boolean function based modes ofoperation, based upon various pattern mixer codes which may be stored inthe cache 1324 and provided to the inputs of a particular multiplexer1322 a, 1322 b, . . . 1322 n. As shown in FIG. 14, the data output byeach multiplexer 1322 a, 1322 b, . . . 1322 n, may be considered as aBoolean function of the multiplexer selection signals S0, S1, S2. Theparticular Boolean function of the multiplexer selection signals S0, S1,S2 may be selected by storing a particular pattern mixer code in thecache 1324 and providing the pattern mixer code to the inputs of aparticular multiplexer 1322 a, 1322 b, . . . 1322 n.

For example, if the pattern mixer code 00 (hex) is stored in the cache1324 and provided to the inputs of the multiplexer 1322 a, for example,the data output of the multiplexer 1322 a is a constant 0 bit value.Similarly, if the pattern mixer code FF (hex) is stored in the cache1324 and provided to the inputs of the multiplexer 1322 a, for example,the data output of the multiplexer 1322 a is a constant 0 bit value. Ifthe pattern mixer code AA (hex) is stored in the cache 1324 and providedto the inputs of the multiplexer 1322 a, for example, the data output ofthe multiplexer 1322 a is the same as the multiplexer selection signalS0. (The other multiplexer selection signals S1, S2 are “don't care” forpattern mixer code AA). Similarly, if the pattern mixer code CC or F0(hex) is stored in the cache 1324 and provided to the inputs of themultiplexer 1322 a, for example, the data output of the multiplexer 1322a is the same as the multiplexer selection signal S1, S2, respectively.

If the pattern mixer code 03 (hex) is stored in the cache 1324 andprovided to the inputs of the multiplexer 1322 a, for example, the dataoutput of the multiplexer 1322 a is the same as the Boolean AND functionof the inverse of each of the multiplexer selection signals S0 and S1.(The other multiplexer selection signal S2 is “don't care” for patternmixer code 03). If the pattern mixer code 80 (hex) is stored in thecache 1324 and provided to the inputs of the multiplexer 1322 a, forexample, the data output of the multiplexer 1322 a is the same as theBoolean AND function of the multiplexer selection signals S0, S1 and S2.If the pattern mixer code C0 (hex) is stored in the cache 1324 andprovided to the inputs of the multiplexer 1322 a, for example, the dataoutput of the multiplexer 1322 a is the same as the Boolean AND functionof the multiplexer selection signals S0 and S1. (The other multiplexerselection signal S2 is “don't care” for pattern mixer code C0). If thepattern mixer code EE (hex) is stored in the cache 1324 and provided tothe inputs of the multiplexer 1322 a, for example, the data output ofthe multiplexer 1322 a is the same as the Boolean OR function of themultiplexer selection signals S0 and S1. (The other multiplexerselection signal S2 is “don't care” for pattern mixer code EE). It isappreciated that other Boolean functions may be selected using otherpattern mixer codes, depending upon the particular application.

In one embodiment, the pattern mixer code is programmed at the beginningof the test, and may be relatively static, that is, is not reprogrammedas the test progresses through the test cycle. Conversely, the patternstreams of the multiplexer selection signals S0, S1, S2 connected to themultiplex select inputs 1318 may be relatively dynamic, that is, changeon every clock cycle, for example. By comparison, in prior multiplexedschemes, it is believed that dynamic input streams typically go to themultiplexer inputs and one of the dynamic streams is selected withrelatively static selection signals on the select lines of themultiplexer.

In another aspect of the algorithm generator 1310, each the patternsequencer 1314 a, 1314 b, 1314 c, is a multi-mode pattern sequencer inwhich a mode of operation may be selected to output a selected patternof multiplexer selection signals S0, S1, S2. 20. FIG. 15 shows oneexample of the pattern sequencers 1314 a as a multi-mode patternsequencer. The other pattern sequencers 1314 b, 1314 c may beconstructed in a similar fashion. The capability of selecting one of aplurality of modes of operation in each sequences permits, for example,allowing the same sequence for outbound patterns directed to the memoryto be used for many tests on many devices, as well as allowing patternsof the expected results for comparing to inbound test results to begenerated on the fly. Thus, test patterns for stress testing memoryregions may be generated in real time as expected results patterns forthose test patterns are generated either at the same time or inoverlapping fashion, for example.

The pattern sequencer 1314 a includes a first fixed pattern mode inwhich a shift register 1510 shifts a fixed pattern stored in the shiftregister 1510 on a shift register output 1512, through an outputmultiplexer 1513 to the pattern sequencer output, which is multiplexerselect signal S0, in this example. The pattern may be shifted into theshift register 1510 through an input multiplexer 1515. The patternsequencer 1314 a further includes a clock signal pattern mode which aclock signal generator 1514 outputs a clock signal on an output 1516,through the output multiplexer 1513 m to the pattern sequencer output,that is, the multiplexer selection signal S0. In the illustratedembodiment, the clock signal has a programmable period and programmableduty cycle in which the length of the clock pulse within the clockperiod is programmable.

FIG. 16 shows an example of such a clock signal, clocka, clockb, etc.,in which a first counter of the combinational logic of the clock signalgenerator 1514 (FIG. 15) times the delay 1614 of the initiation of theclock pulse 1616 of the clock signal within the clock period. A secondcounter 1524 of the combinational logic times the duration 1618 of theclock pulse, and a third counter 1528 times the duration 1622 of theremaining period of the clock signal after the clock pulse 1616 untilthe beginning of the next clock signal, clockb. In this manner,relatively long clock signals may be readily generated. In someembodiments, a sweep mode of the clock signal mode in which thefrequency or duty cycle may change as the test progresses.

The pattern sequencer 1314 a further includes a linear feedback modewhich outputs a linear feedback polynomial pattern to the patternsequencer output, S0. The pattern sequencer 1314 a has linear feedbackpolynomial logic 1532 of a finite state machine 1538 which determinesthe next state of the finite state machine 1538 of the multi-modepattern sequencer 1314 a. An output 1512 of the shift register 1510 isfed back to inputs of the linear feedback polynomial logic 1532, and toan input of the input multiplexer 1515.

As best seen in FIG. 17, each bit of the linear feedback polynomiallogic 1532 includes one or more multiplexers 1710 having an inputcoupled to the output of a bit register 1714 of the shift register 1510(FIG. 15) and an output coupled to the input of the shift register 1510.Another input of the multiplexer 1710 of each bit of the linear feedbackpolynomial logic 1532, is coupled to polynomial combinational logic asrepresented by an exclusive-OR gate 1720. The linear feedback polynomiallogic 1532 of the finite state machine 1538 determines the next state ofthe finite state machine 1538 of the multi-mode pattern sequencer 1314a, in which the state of the finite state machine 1538 is represented bythe bits stored in the bit registers of the shift register 1510. In thismanner, the linear feedback polynomial finite state machine 1538 of thelinear feedback mode shares the bit registers 1714 of the shift register1510 of the fixed pattern mode. Thus, in this example, the linearfeedback mode, which may also be referred to as a linear feedback shiftregister (LFSR) based mode, the shift register 1510 holds the initialseeds provided through the input multiplexer 1515, and the LFSR feedbackpolynomials of the logic 1532 determine the next states of the statemachine 1538. In one embodiment, the logic 1532 supports multipleoptimized LFSR polynomials which may vary in size, such as from 8 bitsto 32 bits, for example.

As previously mentioned, a random pattern generated by an algorithmgenerator such as the algorithm generator 354 a, for example, executinga selected algorithm instruction, such as the Algorithm Instruction 1,for example, may be used to create white noise on an interconnect tostress the interconnect to test for a defect. Thus, if one patternsequencer such as pattern sequencer 1314 a, for example, was programmedto be operated in the clock signal mode to generate a low frequencyclock signal on multiplexer select line S1, and another patternsequencer such as the pattern sequencer 1314 b was programmed to operatein the LFSR based mode to generate a random appearing bit pattern on themultiplexer select line S2, the Boolean function of S1 AND S2 providedby the pattern mixer code C0 (hex) will provide a burst of noisefollowed by quiet period, and the cycle repeats.

In one embodiment, seed data may be provided, and a mode of operationmay be selected from the available modes of operation including thefixed pattern mode of the shift register 1510, the programmable clocksignal mode of the clock generator 1514, and the linear feedbackpolynomial mode, by application of one or more algorithm instructions inthe sequence 356 (FIG. 3a ) of algorithm instructions, AlgorithmInstruction 1, Algorithm Instruction 2 . . . Algorithm Instruction n. Inother embodiments, modes may be selected by other portions of the testercircuit.

FIG. 18a shows one example of operations of a data generator such as thedata generator 344 a (FIG. 18b ) of the programmable data patterngenerator 342 (FIG. 30 wherein the generated pattern of data output atan output 1804, is a selectable function of the pattern of memory celladdresses of the memory cells in which the generated pattern of data iswritten. The generated pattern of data may be used for writing test datato the memory device. In addition, a copy of the generated pattern ofdata may be sent to the defect detector circuit 220 for verifyingwhether the generated pattern of data was correctly stored and retrievedby the memory region under test.

For example, a “data background” function is a selectable function whichmay be selected by a parameter of a data instruction being executed bythe data generator 344 a. Accordingly, in the embodiment of FIG. 18b ,the data generator 344 a has an input 1810 for receiving parameters ofthe data instructions by which a function may be selected. In a firstoperation, a memory address-based background function is selected (block1812, FIG. 18a ) at the input 1810. A pattern of data and inverted datais generated (block 1814) in accordance with selected memoryaddress-based background function and output at the output 1804.

An example of one such data background function is a “solid” function inwhich the same value (such as a logical 1, for example) is written toand then subsequently read back from every address of a particularregion under test as illustrated in FIG. 19a for a memory region 1910 ofmemory cells 340 (FIG. 3c ) of the memory 104. The memory region 1910 isrepresented by a five by five array of memory cells 340 arranged incolumns and rows. As previously mentioned, a typical memory region maybe substantially larger and thus may have memory cells numbering in thekilobytes, megabytes, gigabytes, terabytes or more. One example of amemory region is often referred to as a “bank.” Each memory cell 340 maystore a single bit, a byte, a word or a longer string of bits, dependingupon the particular application.

Another data background function which may be selected by an appropriateparameter of a data instruction being executed by the data generator 344a, is a “alternating column stripe” function in which data which isbeing generated, is written to and then subsequently read back fromevery address of the even columns of a particular region under test asillustrated in FIG. 19b for the memory region 1910 of memory cells 340(FIG. 3c ) of the memory 104, and in which data which is beinggenerated, is inverted and then written to and then subsequently readback from every address of the odd columns of a particular region undertest as illustrated in FIG. 19b for the memory region 1910 of memorycells 340 (FIG. 3c ) of the memory 104. It is appreciated that in otherembodiments, the inverted data may be written to the even columnsinstead of the odd columns.

Accordingly, the data generator 344 a of the embodiment of FIG. 18bincludes a data inverter 1820 which can selectively invert the generateddata before it is written to the memory region under test, as a functionof the addresses of the memory cells to which the data is being written.Thus, in the embodiment of FIG. 18b , the data generator 344 a has aninput 1830 for receiving the addresses being generated by one or moreaddress generators of the test pattern generator 210 (FIG. 2). In thisexample, the data inverter 1820 selectively inverts the generated dataas a function of the column addresses of the memory cells of the regionto be tested. More specifically, the data is inverted for odd columnaddresses and remains uninverted for even column addresses. For example,in one embodiment, the data may be inverted (Inverted Data) if the leastsignificant (or lowest order) bit of the column address is odd (alogical “1”) and may remain uninverted (Data) if the least significantbit of the column address is even (a logical “0”). It is appreciatedthat in other embodiments, the data may be inverted for even columnaddresses and remain uninverted for odd column addresses. The data whichis selectively inverted or selectively remains uninverted, may begenerated internally by the data generator 344 a, or may be generated byanother data generator 344 b . . . 344 n of the test pattern generator210 and input at an input 1840 of the data generator 344 a.

Another data background function which may be selected by an appropriateparameter of a data instruction being executed by the data generator 344a, is a “alternating row stripe” function in which data which is beinggenerated, is written to and then subsequently read back from everyaddress of the even rows of a particular region under test asillustrated in FIG. 19c for the memory region 1910 of memory cells 340(FIG. 3c ) of the memory 104, and in which data which is beinggenerated, is inverted and then written to and then subsequently readback from every address of the odd rows of a particular region undertest as illustrated in FIG. 19c for the memory region 1910 of memorycells 340 (FIG. 3c ) of the memory 104. It is appreciated that in otherembodiments, the inverted data may be written to the even rows insteadof the odd rows.

In this example, the data inverter 1820 selectively inverts thegenerated data as a function of the row addresses of the memory cells ofthe region to be tested. More specifically, the data is inverted for oddrow addresses and remains uninverted for even row addresses. Forexample, in one embodiment, the data may be inverted (Inverted Data) ifthe least significant (or lowest order) bit of the row address is odd (alogical “1”) and may remain uninverted (Data) if the least significantbit of the row address is even (a logical “0”). It is appreciated thatin other embodiments, the data may be inverted for even row addressesand remain uninverted for row column addresses.

Yet another data background function which may be selected by anappropriate parameter of a data instruction being executed by the datagenerator 344 a, is an alternating row and column cell or “checkerboard”function in which data which is being generated, is written to and thensubsequently read back from every even cell address of the even rows ofa particular region under test as illustrated in FIG. 19d for the memoryregion 1910 of memory cells 340 (FIG. 3c ) of the memory 104, and inwhich data which is being generated, is inverted and then written to andthen subsequently read back from every odd cell address of the even rowsof a particular region under test as illustrated in FIG. 19d for thememory region 1910 of memory cells 340 (FIG. 3c ) of the memory 104.

Similarly, in the “checkerboard” function, data which is beinggenerated, is written to and then subsequently read back from every oddcell address of the odd rows of a particular region under test asillustrated in FIG. 19d for the memory region 1910 of memory cells 340(FIG. 3c ) of the memory 104, and data which is being generated, isinverted and then written to and then subsequently read back from everyeven cell address of the odd rows of a particular region under test asillustrated in FIG. 19d for the memory region 1910 of memory cells 340(FIG. 3c ) of the memory 104. In the illustrated embodiment, the leastsignificant (or lowest order) bit of the column address and the leastsignificant bit of the row address of each memory cell 340 are input inan Exclusive-OR function to determine whether the data generated toWrite/Read to that specific address is inverted (Inverted Data) orremains uninverted (Data). It is appreciated that in other Checkerboarddata background functions, the inverted data may be written to the evencell addresses of the even rows instead of the odd cell addresses of theeven rows, and the inverted data may be written to the odd celladdresses of the odd rows instead of the even cell addresses of the oddrows.

In this example, the data inverter 1820 selectively inverts thegenerated data as a function of both the row and column addresses of thememory cells of the region to be tested. More specifically, the data isinverted (or not inverted) as an Exclusive-OR function of the leastsignificant bit of the row and column addresses. It is appreciated thatin other embodiments, the data may be inverted (or not inverted) as afunction of other functions including other logical function, of the rowand column addresses, depending upon the particular application.

In the illustrated embodiment, a data background function may beselected using an appropriate parameter of a data instruction. Thus, asolid data background function, an alternating column stripe backgroundfunction, an alternating row stripe background function or acheckerboard background function, may be selected using a parameter codeof 00, 01, 10 or 11, respectively, for example. It is appreciated thatother data background functions may be selected and other instructionparameter codes may be utilized to select the particular data backgroundfunctions, depending upon the particular application.

Another example of a selectable function for the generated pattern ofdata is a global invert function which globally inverts all data beinggenerated for all memory cells of the region under test. Such a globalinversion of the test data may be selected using an appropriateparameter of a data instruction, for example.

Another example of a selectable function for the generated pattern ofdata is a selectable periodic data inversion function in which data isinverted as a function of a periodic pattern of memory address offsets.Accordingly, in the embodiment of FIG. 18b , the data generator 344 ahas an input 1850 for receiving address offsets being generated by oneor more address offset generators of the test pattern generator 210(FIG. 2), in response to appropriate offset address instructions. Asexplained below, a selectable periodic pattern of memory address offsetsmay be generated by a selectable periodic memory address offsetfunction. In one embodiment, the selectable periodic memory addressoffset function may be selected with an appropriate offset addressinstruction which is executed by an address offset generator to generatethe selected periodic pattern of memory address offsets.

Utilizing a selectable periodic data inversion function, data beingwritten to a memory region under test, may be inverted on a select setof cells of that region in response to an address offset instruction, asthe memory region is being traversed. Similarly, when the memory regionis traversed a second time to read the data from the memory region toverify the prior data write operations, another address offsetinstruction may be used to account for the periodic data inversion ofthe data write operations.

One example of a selectable periodic data inversion function which maybe selected by an appropriate address offset instruction being executedby an address offset generator and an appropriate data instructionexecuted by the data generator 344 a, is a “single column stripe”function in which data which is being generated, is inverted and thenwritten to a single column such as the column Col1, for example, of FIG.19e of a memory region 1920 which is a four by four memory cell regionin this example. For the remaining columns of the memory region 1920under test, the data which is being generated, is written without beinginverted as indicated for the columns Col0, Col2-Col3 of FIG. 19e .Although the memory region 1920 under test is depicted as a four by fourarray of memory cells in FIG. 19e for clarity purposes, it isappreciated that the memory region under test may typically have tens,hundreds, thousands, millions, etc. of memory cells, depending upon theparticular application.

In traversing the four by four cell memory region 1920 depicted in FIG.19e , the base cell of the traversal may be considered to be the cell atthe row and column address Row0, Col1, for example. In this example, thedata written to the base cell at Row0, Col1, is inverted as shown inFIG. 19e . The memory region 1920 may be traversed from left to rightalong a row, for example. This left to right traversal along a row isindicated as the “north” direction in FIG. 19 e.

If the data written to the base cell at the row and column address Row0,Col1, is inverted, the data written to the next three data cells (atRow0, Col2; Row0, Col3; Row1, Col0; respectively) in a north traversalof a single column stripe data inversion pattern are not inverted.Continuing the traversal in the north direction, the data written to thenext cell at the row and column address Row1, Col1, is inverted, and thedata written to the next three data cells (at Row1, Col2; Row1, Col3;Row2, Col0; respectively) in the north direction traversal are notinverted. This process is repeated until data has been written to allthe memory cells of the memory region under test wherein the datawritten to the cells of a four by four memory region in a northdirection traversal is inverted every fourth cell to produce a singlecolumn stripe data inversion pattern with a period of four cells.

The number of rows or the number of columns of a square array of memorycells in a memory region under test may be represented by the variableN. Thus, for a single column stripe data inversion pattern for an N by Narray of memory cells in the memory region under test, the period of theperiodic data inversion function is equal to N for a traversal in thenorth direction. For an M (rows) by N (columns) rectangular array, theperiod of the periodic data inversion function is equal to N, the numberof columns within the array, for a traversal in the north direction.

The memory region 1920 may traversed in the south direction in a singlecolumn stripe data inversion pattern, instead of in the north direction.It is seen that the data written to the cells of a four by four memoryregion in a south direction traversal is again inverted every fourthcell to produce a single column stripe data inversion pattern with aperiod of four cells. Hence, the period of the periodic data inversionfunction in this single stripe pattern is the same, that is, N, thenumber of columns in the array, whether in the north or south directionto produce a single column stripe data inversion pattern. In asubsequent verification test, the data generated to test the data readback from the M (rows) by N (columns) memory region in a north or southdirection traversal is inverted every Nth cell to produce a singlecolumn stripe data inversion pattern with a period of N cells.

Another example of a periodic data inversion function which may beselected by an appropriate address offset instruction being executed bythe data generator 344 a, is a “row stripe” function in which data whichis being generated, is inverted and then written to a single row such asthe row Row1, for example, of FIG. 19f of a memory region 1920 which isa four by four memory cell region in this example. For the remainingrows of the memory region 1920 under test, the data which is beinggenerated, is written without being inverted as indicated for the rowsRow0, Row2-Row3 of FIG. 19e . Although the memory region 1920 under testis depicted as a four by four array of memory cells in FIG. 19e forclarity purposes, it is appreciated that the memory region under testmay typically have tens, hundreds, thousands, millions, etc. of memorycells, depending upon the particular application.

In traversing the four by four cell memory region 1920 depicted in FIG.19e , the base cell of the traversal may be considered to be the cell atthe row and column address Row1, Col0, for example. In this example, thedata written to the base cell at Row1, Col0, is inverted as shown inFIG. 19f . The memory region 1920 may be traversed from up to down alonga column, for example. This up to down traversal along a column isindicated as the “east” direction in FIG. 19 f.

If the data written to the base cell at the row and column address Row1,Col0, is inverted, the data written to the next three data cells (atRow2, Col0; Row3, Col0; Row0, Col1; respectively) in an east traversalof a single row stripe data inversion pattern are not inverted.Continuing the traversal in the east direction, the data written to thenext cell at the row and column address Row1, Col1, is inverted, and thedata written to the next three data cells (at Row2, Col1; Row3, Col1;Row0, Col2; respectively) in the east direction traversal are notinverted. This process is repeated until data has been written to allthe memory cells of the memory region under test wherein the datawritten to the cells of a four by four memory region in an eastdirection traversal is inverted every fourth cell to produce a singlerow stripe data inversion pattern with a period of four cells, where theperiod again equals N, the size of the square array. Thus, for a singlerow stripe data inversion pattern for an N by N square array of memorycells in the memory region under test, the period of the periodic datainversion function is equal to N for a traversal in the east direction.For an N (rows) by M (columns) rectangular array, the period of theperiodic data inversion function is equal to N, the number of rowswithin the array, for a traversal in the north direction.

The memory region 1920 may traversed in the west (down to up) directionin a single row stripe data inversion pattern, instead of in the eastdirection. It is seen that the data written to the cells of a four byfour memory region in a west direction traversal is again inverted everyfourth cell to produce a single row stripe data inversion pattern with aperiod of four cells. Hence, the period of the periodic data inversionfunction in this single row stripe pattern is the same, that is, N, thenumber of rows of the array, whether in the east or west direction toproduce a single row stripe data inversion pattern. In a subsequentverification test, the data generated to test the data read back fromthe N (rows) by M (columns) memory region in an east or west directiontraversal is inverted every Nth cell to produce a single row stripe datainversion pattern with a period of N cells.

Another example of a selectable periodic data inversion function for thegenerated pattern of data in which data is inverted as a function of aperiodic pattern of memory address offsets, is a “diagonal stripe” datainversion function as depicted in FIG. 19g . In the “diagonal stripe”data inversion function, data which is being generated, is inverted andwritten to a diagonal stripe of a memory region 1920 (FIG. 19g ) undertest which may be similar to the memory region 1920 of FIG. 19e , forexample. For the remaining cells of the memory region under test whichare not within the diagonal stripe, the data which is being generated,is written without being inverted.

In traversing the four by four cell memory region 1920 depicted in FIG.19g , the base cell of the traversal may be considered to be the cell atthe row and column address Row0, Col0, for example. In this example, thedata written to the base cell at Row0, Col0, is inverted as shown inFIG. 19g . The memory region 1920 may be traversed from left to rightalong a row, for example. This left to right traversal along a row isindicated as the “north” direction in FIG. 19 g.

If the data written to the base cell at the row and column address Row0,Col0, is inverted, the data written to the next four data cells (atRow0, Col1; Row0, Col2; Row0, Col3; Row1, Col0; respectively) in a northtraversal for a single diagonal stripe data inversion pattern are notinverted, followed by inverting the data written to the next (fifth)cell at the row and column address Row1, Col1. The data written to thenext four data cells (at Row1, Col2; Row1, Col3; Row2, Col0; Row2, Col1;respectively) in the north direction traversal are not inverted, and thedata written to the next (fifth) cell at the row and column addressRow2, Col2, is inverted. This process is repeated until data has beenwritten to all the memory cells of the memory region under test. In thismanner, the data written to the cells of a four by four memory region ina north direction traversal is inverted every fifth cell to produce asingle diagonal stripe data inversion pattern with a period of fivecells. Thus, for a single diagonal stripe data inversion pattern for anN by N array of memory cells in the memory region under test, the periodof the periodic data inversion function is equal to N+1 for a traversalin the north direction. For an M (rows) by N (columns) rectangulararray, the period of the periodic data inversion function is equal toN+1, where N equals the number of columns within the array, for atraversal in the north direction.

The memory region 1920 may also be traversed in the east (down)direction along a column to generate a single diagonal stripe datainversion pattern, instead of in the north (left to right) directionalong a row. It is seen that the data written to the cells of a four byfour memory region in an east direction traversal is again invertedevery fifth cell to produce a single diagonal stripe data inversionpattern with a period of five cells. Hence, the period of the periodicdata inversion function in this single diagonal stripe pattern is thesame whether in the north or east direction to produce a single diagonalstripe data inversion pattern. In a subsequent verification test, thedata generated to test the data read back from the four by four memoryregion in a north or east direction traversal is inverted every fifthcell to produce a single diagonal stripe data inversion pattern with aperiod of five cells. Thus, for a single diagonal stripe data inversionpattern for an N by N array of memory cells in the memory region undertest, the period of the periodic data inversion function is equal to N+1for a traversal in the east direction. For an N (rows) by M (columns)rectangular array, the period of the periodic data inversion function isequal to N+1, where N equals the number of rows within the array, for atraversal in the east direction.

In each period of cells such as a period of five cells discussed inthese examples, the particular cell for which the data is inverted maybe the first cell of the period, or may be the last cell of the periodor may be an intermediate cell of the period. In other embodiments, itis appreciated that the data for more than one cell of the periodincluding intermediate cells, may be inverted to produce a diagonalstripe data inversion pattern.

The memory region 1920 may also be traversed in the west (up) directionalong a column to generate a single diagonal stripe data inversionpattern. In traversing the four by four cell memory region 1920 depictedin FIG. 19g , the base cell of the traversal may again be considered tobe the cell at the row and column address Row0, Col0, for example. Inthis example, the data written to the base cell at Row0, Col0, isinverted as shown in FIG. 19g . The memory region 1920 may be traversedin the west direction from down to up along a column, for example. Thisdown to up traversal along a column is indicated as the “west” directionin FIG. 19 g.

If the data written to the base cell at the row and column address Row0,Col0, is inverted, the data written to the next two data cells (at Row3,Col1; Row2, Col1; respectively) in a west traversal for a singlediagonal stripe data inversion pattern are not inverted, followed byinverting the data written to the next (third) cell at the row andcolumn address Row1, Col1. The data written to the next two data cells(at Row0, Col1; Row3, Col2; respectively) in the west directiontraversal are not inverted, and the data written to the next (third)cell at the row and column address Row2, Col2, is inverted. This processis repeated until data has been written to all the memory cells of thememory region under test. In this manner, the data written to the cellsof a four by four memory region in a west direction traversal isinverted every third cell to produce a single diagonal stripe datainversion pattern with a period of three cells. Thus, for a singlediagonal stripe data inversion pattern for an N by N array of memorycells in the memory region under test, the period of the periodic datainversion function is equal to N−1 for a traversal in the westdirection. For an N (rows) by M (columns) rectangular array, the periodof the periodic data inversion function is equal to N−1, where N equalsthe number of rows within the array, for a traversal in the westdirection.

The memory region 1920 may also be traversed in the south (right toleft) direction along a row to generate a single diagonal stripe datainversion pattern, instead of in the west (down to up) direction along acolumn. It is seen that the data written to the cells of a four by fourmemory region in a south direction traversal is again inverted everythird cell to produce a single diagonal stripe data inversion patternwith a period of three cells. Hence, the period of the periodic datainversion function in this single diagonal stripe pattern is the samewhether in the south or west direction to produce a single diagonalstripe data inversion pattern. In a subsequent verification test, thedata generated to test the data read back from the four by four memoryregion in a north or east direction traversal is inverted every thirdcell to produce a single diagonal stripe data inversion pattern with aperiod of three cells. Thus, for a single diagonal stripe data inversionpattern for an N by N array of memory cells in the memory region undertest, the period of the periodic data inversion function is equal to N−1for a traversal in the south direction. For an M (rows) by N (columns)rectangular array, the period of the periodic data inversion function isequal to N−1, where N equals the number of columns within the array, fora traversal in the south direction.

In each period of cells such as a period of three cells discussed inthese examples, the particular cell for which the data is inverted maybe the first cell of the period, may be the last cell of the period, ormay be an intermediate cell of the period. In other embodiments, it isappreciated that the data for more than one cell of the period includingintermediate cells, may be inverted to produce a diagonal stripe datainversion pattern.

FIG. 20a shows one example of operations of an address offset generatorsuch as the offset address generator 374 a (FIG. 20b ) of theprogrammable address offset pattern generator 370 (FIG. 30 whichprovides a selectable periodic memory address offset function, togenerate a periodic pattern of address offsets output at an output 2004.The periodic pattern of address offsets is a function of a selectableperiod which may be adjusted by a period adjuster circuit 2008 of theoffset address generator 374 a. Accordingly, in the embodiment of FIG.20b , the offset address generator 374 a has an input 2010 for receivingparameters of an offset address instruction by which a period may beselected and adjusted. In this manner, a periodic memory address offsetfunction may be selected. The memory addresses which are offset by theoffset address generator 374 a, may be generated internally by theoffset address generator 374 a, or may be generated by an addressgenerator 310 a, 310 b . . . 310 n of the test pattern generator 210(FIG. 3f ) and input at an input 2012 of the offset address generator374 a.

In a first operation, a period for generating periodic memory addressoffsets is selected (block 2020, FIG. 20a ). In the illustratedembodiment, the period for generating periodic memory address offsetsmay be specified as a parameter of an offset address instruction whichmay be input at the input 2010 of the offset address generator 374 a. Asindicated above, in the example of an N by N array, the period forgenerating periodic memory address offsets may be initially specified asN, as a parameter of an offset address instruction. In the example of anM (rows) by N (columns) array, the period for generating periodic memoryaddress offsets may be initially specified as N, the number of columnsof the array, for a north or south traversal, as a parameter of anoffset address instruction. In the example of an N (rows) by M (columns)array, the period for generating periodic memory address offsets may beinitially specified as N, the number of rows of the array, for an eastor west traversal, as a parameter of an offset address instruction. Itis appreciated that an offset address instruction may have otherparameters such as a parameter enabling a periodic data inversionfunction.

In another operation, an adjustment for the specified period forgenerating periodic memory address offset, is selected (block 2024, FIG.20a ). In the illustrated embodiment, the adjustment for adjusting theperiod for generating periodic memory address offsets may be specifiedas a parameter of an offset address instruction which may be input atthe input 2010 of the offset address generator 374 a. The table of FIG.21 indicates examples of parameter codes which may be used to selectvarious adjustments to the specified period for generating a pattern ofperiodic memory address offsets for various periodic data inversionfunctions. Thus, for a memory cell array, adjustment to the specifiedinitial period N for generating periodic memory address offsets may bespecified as 0 using a parameter code such as 00, for example, as shownin FIG. 21. Similarly, adjustment to the specified period N forgenerating periodic memory address offsets may be specified as +1 usinga parameter code such as 01 or 10, for example. Also, adjustment to thespecified period N for generating periodic memory address offsets may bespecified as −1, using a parameter code such as 11, for example. It isappreciated that other adjustments may be made to the period of aperiodic data inversion function, using other parameter codes, dependingupon the particular application.

As set forth above, for a single column stripe data inversion pattern(FIG. 19e , for example) for a memory region under test, the period ofthe periodic data inversion function is initially equal to N, the numberof columns of the memory region, for a traversal in the north (or south)direction. Hence, as indicated in the table of FIG. 21, for a singlecolumn stripe data inversion pattern, the adjustment to the period maybe specified using an appropriate offset address instruction parametercode, to be zero (0) so that the adjusted period remains N. The datainversion may occur on the Nth access to the cells of the period inresponse to this offset address instruction parameter.

Similarly, for a single row stripe data inversion pattern (FIG. 19f ,for example) for a memory region under test, the period of the periodicdata inversion function may initially be specified to be equal to N, thenumber of columns of the memory region, for a traversal in the west (oreast) direction. Hence, for a single row stripe data inversion pattern,the adjustment to the period may be specified using an appropriateoffset address instruction parameter code to again be zero (0). The datainversion may occur on the Nth access, for example, to the cells of theperiod in response to this offset address instruction parameter.

Thus, an adjustment of zero to the period of the periodic data inversionfunction with an inversion on the Nth access, may be selected byproviding a parameter code such as of 00, for example, as a parameter ofan offset address instruction as indicated in FIG. 21, to provide a rowor column stripe periodic data inversion function. It is appreciatedthat the inversion may be selected to occur on other accesses to thecells of each period, depending upon the particular application.

Also as set forth above, for a single diagonal stripe data inversionpattern (FIG. 9g , for example) for a memory region under test, theinitial period of the periodic data inversion function is adjusted toequal to N+1 for a traversal in the north (or east) direction. Hence,for a single diagonal stripe data inversion pattern being traversed inthe north or east direction, the adjustment to the period may bespecified to be plus one (+1), using an offset address instructionparameter code of 01 or 10, for example. A parameter code of 01 may beused to specify that the inversion occurs on the Nth access to the cellsof the period. Conversely, a parameter code of 10 may be used to specifythe inversion occurs on the first access to the cells of the period. Itis appreciated that other parameter codes may be utilized to select theappropriate adjustment to the period and the appropriate access for theinversion to achieve a particular periodic data inversion function.

Similarly, for a single diagonal stripe data inversion pattern (FIG. 9g, for example) for a memory region under test, the initial period of theperiodic data inversion function may be adjusted to equal to N−1 for atraversal in the west (or south) direction. Hence, for a single diagonalstripe data inversion pattern being traversed in the west (or south)direction, the adjustment to the period may be specified to be minus one(−1) using an offset address instruction parameter code of 11. Theparameter code of 11 may also be used to specify that the inversionoccurs on the Nth access to the cells of the period. It is appreciatedthat other parameter codes may be utilized to select the appropriateadjustment to the period and the appropriate access for the inversion toachieve a particular periodic data inversion function.

A pattern of offset memory addresses may be generated (block 2026, FIG.20a ) to invert data in accordance with a selected offset addressinstruction. As previously mentioned, the pattern of data output at anoutput 1804 of the data generator 344 a, is generated as a selectablefunction of the pattern of memory cell addresses of the memory cells inwhich the generated pattern of data is to be written. One suchselectable function discussed above is a selectable periodic datainversion function in which data is selectively inverted as a functionof a selectable periodic pattern of memory address offsets. In theembodiment of FIG. 18b , the input 1850 of the data generator 344 areceives the periodic pattern of address offsets being generated by theaddress offset generator 374 a of the test pattern generator 210 (FIG.2), in response to appropriate offset address instructions.

Accordingly, a periodic data inversion function such as the singlecolumn stripe function, the single row stripe function, and the singlediagonal stripe function, may be selected using an offset addressinstruction having appropriate parameters defining the initial period ofthe periodic pattern of address offsets being generated by the addressoffset generator 374 a of the test pattern generator 210, and theadjustments to the period and cell access within the period, asdiscussed above. It is appreciated that other periodic data inversionfunctions and other periodic patterns of address offsets may beselected, depending upon the particular application.

In the illustrated embodiment, in traversing a memory region under testin connection with a periodic data inversion function, the increments tothe row addresses and column addresses may be limited to a plus one (+1)increment, for example. It is appreciated that in other embodiments, thesize of the row or column increments for traversing a memory region mayvary, depending upon the particular application.

In another aspect of the present description, a periodic data inversionfunction as described herein may be repeated, incrementing the addressof the base cell each time the periodic data inversion function isperformed. In one embodiment, the number of repeats of the periodicpattern of address offsets may be set to the number of cells within thememory region under test.

In still another aspect of the present description, inversion functionsas described herein may be chained together to invert the data in stages2110-2130 as depicted in FIG. 22. The output of a data inversionfunction in one stage, is input by the data inversion function of thenext stage of the chain.

The inversion functions, Function (X, inv), Function (Y, inv), Function(Z, inv), represent various inversion functions, each which may be aperiodic data inversion function as described herein or anotherinversion function such as data background function, for example. Thus,the output of one inversion function stage having an inversion functionsuch as a single diagonal stripe pattern inversion function, may beinput by the next stage having a global inversion function, for example.Other combinations of inversion functions may be chained together instages, depending upon the particular application. Although FIG. 22depicts three such inversion functions chained together, it isappreciated that the number of chained inversion functions may varydepending upon the particular application.

In another aspect of the present description, a user or vendor definedfunction of a stage 2140 may also be chained with the pattern generationfunctions described herein. The user or vendor defined function mayinclude logical to physical memory address mapping logic 2150 to providea logical to physical mapping of memory addresses. Mapping values formapping of the logical to physical memory address mapping logic 2150 maybe defined by the user or vendor using registers 2160 of the user orvendor defined function stage 2140.

It is appreciated that memory addresses which are contiguous in alogical memory space may not be physically contiguous in the actualphysical layout of physical blocks of memory. Thus, a row address may beused, for example, as a key to determine if odd and/or even data bitsare to be inverted. This data generation capability provides a userdefined function through registers space similar to programmable logicarray to give the vendors the flexibility to program the inversion as afunction of address bits after a design has been implemented in anintegrated circuit device without changing the integrated circuitdevice. Moreover, this user defined function frees a designer frompredicting a particular vendor's physical address map ahead of time, andthe vendor need not disclose their physical layout while using thetester described herein to test their memory circuits.

Another example of a selectable function for the generated pattern ofdata is a data lane rotation function which rotates a lane of data beinggenerated for a memory region under test. For example, a memory having a64 bit data bus may be thought of as having 64 data lanes thatcorrespond to the 64 bit data bus. FIG. 23 shows an example of a datalane Lane0 having five bits, bit0-bit4, arranged right to left fromleast significant bit (LSB) to most significant bit (MSB). It isappreciated that the number of bits in each lane such as Lane0 may varydepending upon the particular application. For example, the number ofbits may be substantially larger, depending upon the size of the datapattern being generated and the size of the memory region under test.

The data of each lane of the data pattern being generated may be rotatedone data bit position each rotation, in a direction from the leastsignificant bit position toward the most significant bit as shown inFIG. 23 which depicts four such rotations. Each rotation, the bit at themost significant bit position rotates back to the least significant bitposition. The data lane rotation function may be enabled in a parameterof a data instruction, for example. The number of rotations maysimilarly be specified in a parameter of a data instruction. The datapattern of each rotation may be applied in turn to a memory region beingtested and used to test the results of each such test.

EXAMPLES

The following examples pertain to further embodiments.

Example 1 is a memory controller for use with a memory having memorycells including spare memory cells, comprising:

an internal self-test logic circuit built in within the memorycontroller, the self-test logic circuit including:

a test pattern generator for generating test patterns and for testingmemory cells within the memory using the generated test patterns;

a repository; and

a detector circuit adapted to detect defective memory cells in responseto the test patterns testing the memory cells, and to store in therepository within the memory controller, a list of memory locations,each memory location of the list having a set of memory cells whichincludes at least one defective memory cell; and

an internal self-repair logic circuit built in within the memorycontroller, the internal self-repair logic including a repair logiccircuit adapted to read the list of memory locations stored in therepository, and to repair the memory locations of the list bysubstituting a memory location of spare memory cells, for a memorylocation having at least one defective memory cell.

In Example 2, the subject matter of Examples 1-20 (excluding the presentExample) can optionally include a semiconductor die wherein the internalself-test logic circuit and the internal self-repair logic circuit aredisposed on the die of the memory controller.

In Example 3, the subject matter of Examples 1-20 (excluding the presentExample) can optionally include that the test pattern generator includesa plurality of generators including at least one address generator, anda loop sequencer circuit adapted to apply to the generators a pluralityof nested loop instructions, including a sequential loop of addressinstructions in a sequence of address instructions to an addressgenerator, each address instruction of the sequence when executed by anaddress generator, causes an address generator to generate a pattern ofmemory cell addresses, and wherein the test pattern generator is adaptedto execute memory commands at memory cells addressed by a pattern ofmemory cell addresses generated by an address instruction being executedin sequence in the loop of address instructions.

In Example 4, the subject matter of Examples 1-20 (excluding the presentExample) can optionally include that the plurality of generatorsincludes at least one data generator, and wherein the loop sequencercircuit is adapted to apply to a data generator, a sequential loop ofdata instructions in a sequence of data instructions, each datainstruction of the sequence when executed by a data generator, causes adata generator to generate a pattern of data for a pattern of test data,wherein the sequential loop of data instructions is nested withinanother loop of instructions, and wherein the test pattern generator inexecuting memory commands at memory cells is adapted to write a patternof test data generated by a data instruction being executed in sequencein the loop of data instructions, in memory cells addressed by a patternof memory cell addresses generated by an address instruction beingexecuted in sequence in the loop of address instructions.

In Example 5, the subject matter of Examples 1-20 (excluding the presentExample) can optionally include that the plurality of generatorsincludes at least one algorithm generator and wherein the loop sequencercircuit is adapted to apply to an algorithm generator, a sequential loopof algorithm instructions in a sequence of algorithm instructions, eachalgorithm instruction of the sequence when executed by an algorithmgenerator causes an algorithm generator to generate a pattern of datafor a pattern of test data, wherein the sequential loop of algorithminstructions is nested within another loop of instructions, and whereinthe test pattern generator in executing memory commands at memory cellsis adapted to write a pattern of test data in accordance with analgorithm instruction being executed in sequence in the loop ofalgorithm instructions, in memory cells addressed by a pattern of memorycell addresses generated by an address instruction being executed insequence in the loop of address instructions.

In Example 6, the subject matter of Examples 1-20 (excluding the presentExample) can optionally include that the plurality of generatorsincludes at least one command generator and wherein the loop sequencercircuit is adapted to apply to a command generator, a sequential loop ofcommand instructions in a sequence of command instructions, each commandinstruction of the sequence when executed by a command generator causesa command generator to generate a pattern of memory commands, whereinthe sequential loop of command instructions is nested within anotherloop of instructions, and wherein the test pattern generator inexecuting memory commands at memory cells is adapted to execute apattern of commands generated by a command instruction being executed insequence in the loop of command instructions, said pattern of commandswriting a pattern of test data generated by the output of the testpattern generator in response to an algorithm instruction being executedin sequence in the loop of algorithm instructions, and in response to adata instruction being executed in sequence in the loop of datainstructions, in memory cells addressed by a pattern of memory celladdresses generated by an address instruction being executed in sequencein the loop of address instructions.

In Example 7, the subject matter of Examples 1-20 (excluding the presentExample) can optionally include that the plurality of generatorsincludes at least one address offset generator and wherein the loopsequencer is adapted to apply to an address offset generator, asequential loop of memory address offset instructions in a sequence ofmemory address offset instructions, each memory address offsetinstruction of the sequence when executed by an address offsetgenerator, causes an address offset generator to generate a pattern ofmemory address offsets, wherein the sequential loop of memory addressoffset instructions is nested within another loop of instructions, andwherein the test pattern generator in executing memory commands atmemory cells is adapted to execute a pattern of commands generated by acommand instruction being executed in sequence in the loop of commandinstructions in memory cells addressed by a pattern of memory celladdresses generated by an address instruction being executed in sequencein the loop of address instructions and offset by the pattern of memoryaddress offsets generated by a memory address offset instruction beingexecuted in sequence in the loop of memory address offset instructions.

In Example 8, the subject matter of Examples 1-20 (excluding the presentExample) can optionally include that the memory cells are arranged in aplurality of memory regions, and wherein the detector circuit is adaptedto determine if the number of memory locations having at least onedefective memory cell exceeds a maximum for a particular memory regionand if so, to set a flag indicating that the number of memory locationshaving at least one defective memory cell exceeds the maximum for theparticular memory region.

In Example 9, the subject matter of Examples 1-20 (excluding the presentExample) can optionally include that the memory cells are arranged inmemory regions of memory cells, each memory region comprising an arrayof memory cells arranged in rows and columns of memory cells, and eachmemory location of a memory region is a row of memory cells, and whereinthe detector circuit is adapted to determine if a particular row ofmemory cells of a particular memory region of memory cells has alreadybeen stored as an entry in the list of the repository, and to bypass thestoring in the repository the particular row of the particular memoryregion of memory cells as an entry of the list of memory locations ifthe particular row of memory cells of the particular memory region ofmemory cells has already been stored as an entry in the list of therepository.

In Example 10, the subject matter of Examples 1-20 (excluding thepresent Example) can optionally include that the memory cells arearranged in memory regions of memory cells, each memory regioncomprising an array of memory cells arranged in rows and columns ofmemory cells, and each memory location of a memory region is a row ofmemory cells, and wherein the detector circuit is adapted to set a flagfor each memory region, indicating whether at least one row of theparticular memory region has at least one defective memory cell in theat least one row of memory cells of the particular memory region.

In Example 11, the subject matter of Examples 1-20 (excluding thepresent Example) can optionally include that the memory cells arearranged in memory regions of memory cells, each memory regioncomprising an array of memory cells arranged in rows and columns whereineach memory cell has a row address and a column address, and wherein theat least one address generator is a first configurable pipeline addressgenerator having a plurality of pipeline stages, having an address carrycount generator in a first pipeline stage, and one of a row addressgenerator and a column address generator in a second pipeline stage,which generates one of a row address and a column address, respectively,as a function of the output of the address carry count generator of thefirst pipeline stage.

In Example 12, the subject matter of Examples 1-20 (excluding thepresent Example) can optionally include that wherein the memory regionsare arranged in banks of memory regions, each bank having a bankaddress, and the banks are arranged in ranks of banks, each rank havinga rank address, the first configurable pipeline address generator havinga first configuration which includes a bank address generator in one ofthe first and second pipeline stages, and a rank address generator in atleast one of the first and second pipeline stages.

In Example 13, the subject matter of Examples 1-20 (excluding thepresent Example) can optionally include that wherein in the firstconfiguration of the configurable pipeline address generator, the row,column, bank and rank address generators are arranged in the firstconfigurable pipeline address generator to generate row, column, bankand rank addresses, respectively, sequentially in a first address orderdefining the order in which addresses are sequentially generated by row,column, bank and rank, and wherein the first configurable pipelineaddress generator is configurable in a second configuration wherein inthe first configuration of the configurable pipeline address generator,the row, column, bank and rank address generators are arranged in thefirst configurable pipeline address generator to generate row, column,bank and rank addresses, respectively, sequentially in a second addressorder in which addresses are sequentially generated by row, column, bankand rank, in an address order different from the first address order.

In Example 14, the subject matter of Examples 1-20 (excluding thepresent Example) can optionally include that in the first address order,the configurable pipeline address generator is adapted to sequentiallyincrement bank addresses to the next bank address in sequence before arank address is incremented to the next rank address in sequence, andwherein in the second address order, the configurable pipeline addressgenerator is adapted to sequentially increment rank addresses to thenext rank address in sequence before a bank address is incremented tothe next bank address in sequence.

In Example 15, the subject matter of Examples 1-20 (excluding thepresent Example) can optionally include that in the first address order,the configurable pipeline address generator is adapted to sequentiallyincrement row addresses to the next row address in sequence before acolumn address is incremented to the next column address in sequence,and wherein in the second address order, the configurable pipelineaddress generator is adapted to sequentially increment column addressesto the next column address in sequence before a row address isincremented to the next row address in sequence.

In Example 16, the subject matter of Examples 1-20 (excluding thepresent Example) can optionally include that the pipeline addressgenerator is adapted to be responsive to a clock signal and to producethe next full address including rank, bank, column and row addressesevery clock signal after an initial startup period and wherein theoutput of the address carry count generator of the first pipeline stageis valid in each clock signal after the initial startup period, and thenext full address is valid in each clock signal after the initialstartup period.

In Example 17, the subject matter of Examples 1-20 (excluding thepresent Example) can optionally include that the at least one algorithmgenerator includes a refresh signal generator adapted to generate arefresh signal for the memory cells, having a variable refresh rate.

In Example 18, the subject matter of Examples 1-20 (excluding thepresent Example) can optionally include that the refresh signalgenerator is adapted to generate refresh signals in a declining sequenceof refresh rates for refreshing memory cells at each rate of thedeclining sequence of refresh rates, each refresh rate of the decliningsequence being reduced by an amount from the rate of the prior refreshrate of the declining sequence of refresh rates.

In Example 19, the subject matter of Examples 1-20 (excluding thepresent Example) can optionally include that the at least one algorithmgenerator includes at least one pattern sequencer, each having anoutput, a multiplexer having a plurality of inputs and outputs, and atleast one selector input coupled to an output of at least one patternsequencer, wherein the multiplexer is adapted to select a multiplexerinput to output to a multiplexer output, in response to at least onepattern sequencer coupled to at least one multiplexer selector input.

In Example 20, the subject matter of Examples 1-20 (excluding thepresent Example) can optionally include that at least one patternsequencer is a multi-mode pattern sequencer having a shift registercomprising a plurality of bit registers, a finite state machinecomprising linear feedback polynomial logic coupled to the bit registersof the shift register, and combinational logic including a plurality ofcounters, and a plurality of modes of operation including a fixedpattern mode in which the shift register is adapted to shift a fixedpattern to the pattern sequencer output, a clock signal pattern mode inwhich the pattern sequencer is adapted to output a clock signal to thepattern sequencer output, the clock signal having a programmable dutycycle in which the length of a clock pulse within the clock period isprogrammable, in which a first counter of the combinational logic isadapted to time the delay of initiation of the clock pulse of the clocksignal within the clock period, a second counter of the combinationallogic is adapted to time the duration of the clock pulse, and a thirdcounter is adapted to time the duration of the remaining period of theclock signal after the clock pulse until the beginning of the next clocksignal, and a linear feedback mode in which the pattern sequencer isadapted to output a linear feedback polynomial pattern to the patternsequencer output, in which the linear feedback polynomial logic isadapted to determine the next state of the finite state machine of themulti-mode pattern sequencer.

Example 21 is directed to a computer architecture device, comprising:

memory cells within the device including spare memory cells;

an internal self-test logic circuit built in within the device, theself-test logic circuit including:

a test pattern generator for generating test patterns and for testingmemory cells within the device using the generated test patterns;

a repository; and

a detector circuit adapted to detect defective memory cells in responseto the test patterns testing the memory cells, and to store in therepository within the device, a list of memory locations, each memorylocation of the list having a set of memory cells which includes atleast one defective memory cell; and

an internal self-repair logic circuit built in within the device, theinternal self-repair logic including a repair logic circuit adapted toread the list of memory locations stored in the repository, and torepair the memory locations of the list by substituting a memorylocation of spare memory cells, for a memory location having at leastone defective memory cell.

In Example 22, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the device furthercomprises a memory controller disposed on a semiconductor die within thedevice, for controlling the memory cells of the device and wherein theinternal self-test logic circuit and the internal self-repair logiccircuit are disposed on the die of the memory controller.

In Example 23, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the test pattern generatorincludes a plurality of generators including at least one addressgenerator, and a loop sequencer circuit adapted to apply to thegenerators a plurality of nested loop instructions, including asequential loop of address instructions in a sequence of addressinstructions to an address generator, each address instruction of thesequence when executed by an address generator, causes an addressgenerator to generate a pattern of memory cell addresses, and whereinthe test pattern generator is adapted to execute memory commands atmemory cells addressed by a pattern of memory cell addresses generatedby an address instruction being executed in sequence in the loop ofaddress instructions.

In Example 24, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the plurality of generatorsincludes at least one data generator, and wherein the loop sequencercircuit is adapted to apply to a data generator, a sequential loop ofdata instructions in a sequence of data instructions, each datainstruction of the sequence when executed by a data generator, causes adata generator to generate a pattern of data for a pattern of test data,wherein the sequential loop of data instructions is nested withinanother loop of instructions, and wherein the test pattern generator inexecuting memory commands at memory cells is adapted to write a patternof test data generated by a data instruction being executed in sequencein the loop of data instructions, in memory cells addressed by a patternof memory cell addresses generated by an address instruction beingexecuted in sequence in the loop of address instructions.

In Example 25, the subject matter of 21-40 (excluding the presentExample) can optionally include that the plurality of generatorsincludes at least one algorithm generator and wherein the loop sequencercircuit is adapted to apply to an algorithm generator, a sequential loopof algorithm instructions in a sequence of algorithm instructions, eachalgorithm instruction of the sequence when executed by an algorithmgenerator causes an algorithm generator to generate a pattern of datafor a pattern of test data, wherein the sequential loop of algorithminstructions is nested within another loop of instructions, and whereinthe test pattern generator in executing memory commands at memory cellsis adapted to write a pattern of test data in accordance with analgorithm instruction being executed in sequence in the loop ofalgorithm instructions, in memory cells addressed by a pattern of memorycell addresses generated by an address instruction being executed insequence in the loop of address instructions.

In Example 26, the subject matter of 21-40 (excluding the presentExample) can optionally include that the plurality of generatorsincludes at least one command generator and wherein the loop sequencercircuit is adapted to apply to a command generator, a sequential loop ofcommand instructions in a sequence of command instructions, each commandinstruction of the sequence when executed by a command generator causesa command generator to generate a pattern of memory commands, whereinthe sequential loop of command instructions is nested within anotherloop of instructions, and wherein the test pattern generator inexecuting memory commands at memory cells is adapted to execute apattern of commands generated by a command instruction being executed insequence in the loop of command instructions, said pattern of commandswriting a pattern of test data generated by the output of the testpattern generator in response to an algorithm instruction being executedin sequence in the loop of algorithm instructions, and in response to adata instruction being executed in sequence in the loop of datainstructions, in memory cells addressed by a pattern of memory celladdresses generated by an address instruction being executed in sequencein the loop of address instructions.

In Example 27, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the plurality of generatorsincludes at least one address offset generator and wherein the loopsequencer is adapted to apply to an address offset generator, asequential loop of memory address offset instructions in a sequence ofmemory address offset instructions, each memory address offsetinstruction of the sequence when executed by an address offsetgenerator, causes an address offset generator to generate a pattern ofmemory address offsets, wherein the sequential loop of memory addressoffset instructions is nested within another loop of instructions, andwherein the test pattern generator in executing memory commands atmemory cells is adapted to execute a pattern of commands generated by acommand instruction being executed in sequence in the loop of commandinstructions in memory cells addressed by a pattern of memory celladdresses generated by an address instruction being executed in sequencein the loop of address instructions and offset by the pattern of memoryaddress offsets generated by a memory address offset instruction beingexecuted in sequence in the loop of memory address offset instructions.

In Example 28, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the memory cells arearranged in a plurality of memory regions, and wherein the detectorcircuit is adapted to determine if the number of memory locations havingat least one defective memory cell exceeds a maximum for a particularmemory region and if so, to set a flag indicating that the number ofmemory locations having at least one defective memory cell exceeds themaximum for the particular memory region.

In Example 29, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the memory cells arearranged in memory regions of memory cells, each memory regioncomprising an array of memory cells arranged in rows and columns ofmemory cells, and each memory location of a memory region is a row ofmemory cells, and wherein the detector circuit is adapted to determineif a particular row of memory cells of a particular memory region ofmemory cells has already been stored as an entry in the list of therepository, and to bypass the storing in the repository the particularrow of the particular memory region of memory cells as an entry of thelist of memory locations if the particular row of memory cells of theparticular memory region of memory cells has already been stored as anentry in the list of the repository.

In Example 30, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the memory cells arearranged in memory regions of memory cells, each memory regioncomprising an array of memory cells arranged in rows and columns ofmemory cells, and each memory location of a memory region is a row ofmemory cells, and wherein the detector circuit is adapted to set a flagfor each memory region, indicating whether at least one row of theparticular memory region has at least one defective memory cell in theat least one row of memory cells of the particular memory region.

In Example 31, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the memory cells arearranged in memory regions of memory cells, each memory regioncomprising an array of memory cells arranged in rows and columns whereineach memory cell has a row address and a column address, and wherein theat least one address generator is a first configurable pipeline addressgenerator having a plurality of pipeline stages, having an address carrycount generator in a first pipeline stage, and one of a row addressgenerator and a column address generator in a second pipeline stage,which generates one of a row address and a column address, respectively,as a function of the output of the address carry count generator of thefirst pipeline stage.

In Example 32, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the memory regions arearranged in banks of memory regions, each bank having a bank address,and the banks are arranged in ranks of banks, each rank having a rankaddress, the first configurable pipeline address generator having afirst configuration which includes a bank address generator in one ofthe first and second pipeline stages, and a rank address generator in atleast one of the first and second pipeline stages.

In Example 33, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that in the first configurationof the configurable pipeline address generator, the row, column, bankand rank address generators are arranged in the first configurablepipeline address generator to generate row, column, bank and rankaddresses, respectively, sequentially in a first address order definingthe order in which addresses are sequentially generated by row, column,bank and rank, and wherein the first configurable pipeline addressgenerator is configurable in a second configuration wherein in the firstconfiguration of the configurable pipeline address generator, the row,column, bank and rank address generators are arranged in the firstconfigurable pipeline address generator to generate row, column, bankand rank addresses, respectively, sequentially in a second address orderin which addresses are sequentially generated by row, column, bank andrank, in an address order different from the first address order.

In Example 34, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that in the first address order,the configurable pipeline address generator is adapted to sequentiallyincrement bank addresses to the next bank address in sequence before arank address is incremented to the next rank address in sequence, andwherein in the second address order, the configurable pipeline addressgenerator is adapted to sequentially increment rank addresses to thenext rank address in sequence before a bank address is incremented tothe next bank address in sequence.

In Example 35, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that in the first address order,the configurable pipeline address generator is adapted to sequentiallyincrement row addresses to the next row address in sequence before acolumn address is incremented to the next column address in sequence,and wherein in the second address order, the configurable pipelineaddress generator is adapted to sequentially increment column addressesto the next column address in sequence before a row address isincremented to the next row address in sequence.

In Example 36, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the pipeline addressgenerator is adapted to be responsive to a clock signal and to producethe next full address including rank, bank, column and row addressesevery clock signal after an initial startup period and wherein theoutput of the address carry count generator of the first pipeline stageis valid in each clock signal after the initial startup period, and thenext full address is valid in each clock signal after the initialstartup period.

In Example 37, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the at least one algorithmgenerator includes a refresh signal generator adapted to generate arefresh signal for the memory cells, having a variable refresh rate.

In Example 38, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the refresh signalgenerator is adapted to generate refresh signals in a declining sequenceof refresh rates for refreshing memory cells at each rate of thedeclining sequence of refresh rates, each refresh rate of the decliningsequence being reduced by an amount from the rate of the prior refreshrate of the declining sequence of refresh rates.

In Example 39, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that the at least one algorithmgenerator includes at least one pattern sequencer, each having anoutput, a multiplexer having a plurality of inputs and outputs, and atleast one selector input coupled to an output of at least one patternsequencer, wherein the multiplexer is adapted to select a multiplexerinput to output to a multiplexer output, in response to at least onepattern sequencer coupled to at least one multiplexer selector input.

In Example 40, the subject matter of Examples 21-40 (excluding thepresent Example) can optionally include that at least one patternsequencer is a multi-mode pattern sequencer having a shift registercomprising a plurality of bit registers, a finite state machinecomprising linear feedback polynomial logic coupled to the bit registersof the shift register, and combinational logic including a plurality ofcounters, and a plurality of modes of operation including a fixedpattern mode in which the shift register is adapted to shift a fixedpattern to the pattern sequencer output, a clock signal pattern mode inwhich the pattern sequencer is adapted to output a clock signal to thepattern sequencer output, the clock signal having a programmable dutycycle in which the length of a clock pulse within the clock period isprogrammable, in which a first counter of the combinational logic isadapted to time the delay of initiation of the clock pulse of the clocksignal within the clock period, a second counter of the combinationallogic is adapted to time the duration of the clock pulse, and a thirdcounter is adapted to time the duration of the remaining period of theclock signal after the clock pulse until the beginning of the next clocksignal, and a linear feedback mode in which the pattern sequencer isadapted to output a linear feedback polynomial pattern to the patternsequencer output, in which the linear feedback polynomial logic isadapted to determine the next state of the finite state machine of themulti-mode pattern sequencer.

Example 41 is directed to a method of testing and repairing memory,comprising:

using an internal self-test logic circuit built in within a device,

generating test patterns for testing memory cells within the device;

applying the test patterns to the memory cells within the device;

detecting defective memory cells in response to the applied testpatterns; and

storing in a repository within the device, a list of memory locations,each memory location of the list having a set of memory cells whichincludes at least one defective memory cell; and

using an internal self-repair logic circuit built in within the device,

reading the list of memory locations stored in the repository; and

repairing the memory locations, wherein the repairing includessubstituting a spare memory location having a set of memory cells, for amemory location having at least one defective memory cell.

In Example 42, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the device furthercomprises a memory controller disposed on a semiconductor die within thedevice, for controlling the memory cells of the device and wherein theinternal self-test logic circuit and the internal self-repair logiccircuit are disposed on the die of the memory controller.

In Example 43, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the applying the testpatterns includes executing a sequential loop of address instructions ina sequence of address instructions, each address instruction of thesequence when executed generating a pattern of memory cell addresses,and executing memory commands at memory cells addressed by a pattern ofmemory cell addresses generated by an address instruction being executedin sequence in the loop of address instructions.

In Example 44, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the generating testpatterns includes executing a sequential loop of data instructions in asequence of data instructions, each data instruction of the sequencewhen executed generating a pattern of data for a pattern of test data,wherein the sequential loop of data instructions is nested withinanother loop of instructions, and wherein the executing memory commandsat memory cells includes writing test data generated by a datainstruction being executed in sequence in the loop of data instructions,in memory cells addressed by a pattern of memory cell addressesgenerated by an address instruction being executed in sequence in theloop of address instructions.

In Example 45, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the generating testpatterns includes executing a sequential loop of algorithm instructionsin a sequence of algorithm instructions, each algorithm instruction ofthe sequence when executed generating a pattern of data for a pattern oftest data, wherein the sequential loop of algorithm instructions isnested within another loop of instructions, and wherein the executingmemory commands at memory cells includes writing a pattern of test datain accordance with an algorithm instruction being executed in sequencein the loop of algorithm instructions, in memory cells addressed by apattern of memory cell addresses generated by an address instructionbeing executed in sequence in the loop of address instructions.

In Example 46, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the generating testpatterns includes executing a sequential loop of command instructions ina sequence of command instructions, each command instruction of thesequence when executed generating a pattern of memory commands, whereinthe sequential loop of command instructions is nested within anotherloop of instructions, and wherein the executing memory commands atmemory cells includes executing a pattern of commands generated by acommand instruction being executed in sequence in the loop of commandinstructions, said pattern of commands writing a pattern of test datagenerated by the output of an algorithm of an algorithm instructionbeing executed in sequence in the loop of algorithm instructions, and inresponse to a data instruction being executed in sequence in the loop ofdata instructions, in memory cells addressed by a pattern of memory celladdresses generated by an address instruction being executed in sequencein the loop of address instructions.

In Example 47, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the generating testpatterns includes executing a sequential loop of memory address offsetinstructions in a sequence of memory address offset instructions, eachmemory address offset instruction of the sequence when executedgenerating a pattern of memory address offsets, wherein the sequentialloop of memory address offset instructions is nested within another loopof instructions, and wherein the executing memory commands at memorycells includes executing a pattern of commands generated by a commandinstruction being executed in sequence in the loop of commandinstructions in memory cells addressed by a pattern of memory celladdresses generated by an address instruction being executed in sequencein the loop of address instructions and offset by the pattern of memoryaddress offsets generated by a memory address offset instruction beingexecuted in sequence in the loop of memory address offset instructions.

In Example 48, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the memory cells arearranged in a plurality of memory regions, the method further comprisingdetermining if the number of memory locations having at least onedefective memory cell exceeds a maximum for a particular memory regionand if so, setting a flag indicating that the number of memory locationshaving at least one defective memory cell exceeds the maximum for theparticular memory region.

In Example 49, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the memory cells arearranged in memory regions of memory cells, each memory regioncomprising an array of memory cells arranged in rows and columns ofmemory cells, and each memory location of a memory region is a row ofmemory cells, the method further comprising determining if a particularrow of memory cells of a particular memory region of memory cells hasalready been stored as an entry in the list of the repository, andbypassing the storing in the repository the particular row of theparticular memory region of memory cells as an entry of the list ofmemory locations if the particular row of memory cells of the particularmemory region of memory cells has already been stored as an entry in thelist of the repository.

In Example 50, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the memory cells arearranged in memory regions of memory cells, each memory regioncomprising an array of memory cells arranged in rows and columns ofmemory cells, and each memory location of a memory region is a row ofmemory cells, the method further comprising setting a flag for eachmemory region, indicating whether at least one row of the particularmemory region has at least one defective memory cell in the at least onerow of memory cells of the particular memory region.

In Example 51, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the memory cells arearranged in memory regions of memory cells, each memory regioncomprising an array of memory cells arranged in rows and columns whereineach memory cell has a row address and a column address, and wherein thegenerating a pattern of memory cell addresses includes generating in afirst configurable pipeline address generator having a plurality ofpipeline stages, an address carry count in a first pipeline stage, andgenerating in a second pipeline stage, one of a row address and a columnaddress as a function of the address carry count generated in the firstpipeline stage.

In Example 52, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the memory regions arearranged in banks of memory regions, each bank having a bank address,and the banks are arranged in ranks of banks, each rank having a rankaddress, the method further comprising generating in one of the firstand second pipeline stages in a first configuration of the firstconfigurable pipeline address generator, a bank address, and generatingin one of the first and second pipeline stages in the firstconfiguration of the first configurable pipeline address generator, arank address.

In Example 53, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include generating in the firstconfigurable pipeline address generator, the row, column, bank and rankaddresses sequentially in a first address order defining the order inwhich addresses are sequentially generated by row, column, bank andrank, and generating in a second pipeline address generator, row,column, bank and rank addresses sequentially in a second address orderin which addresses are sequentially generated by row, column, bank andrank, an address order different from the first address order.

In Example 54, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the generating the row,column, bank and rank addresses sequentially in the first address order,includes sequentially incrementing bank addresses to the next bankaddress in sequence of the device before a rank address is incrementedto the next rank address of the device in sequence, and wherein thegenerating the row, column, bank and rank addresses sequentially in thesecond address order, includes sequentially incrementing rank addressesto the next rank address in sequence of the device before a bank addressis incremented to the next bank address of the device in sequence.

In Example 55, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the generating the row,column, bank and rank addresses sequentially in the first address order,includes sequentially incrementing row addresses to the next row addressin sequence of the device before a column address is incremented to thenext column address of the device in sequence, and wherein thegenerating the row, column, bank and rank addresses sequentially in thesecond address order, includes sequentially incrementing columnaddresses the next r column address of the device in sequence before arow address is incremented to the next row address of the device insequence.

In Example 56, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the generating the row,column, bank and rank addresses includes clocking the pipeline addressgenerator with a clock signal and producing the next full addressincluding rank, bank, column and row addresses every clock signal afteran initial startup period and producing a valid address carry countoutput in each clock signal after the initial startup period, andproducing a valid next full address in a subsequent part of each clocksignal after the initial startup period.

In Example 57, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the generating a test datapattern as an output of an algorithm includes generating a refreshsignal having a variable refresh rate, and refreshing memory cells atthe variable refresh rate.

In Example 58, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the generating a refreshsignal having a variable refresh rate includes generating the refreshsignals in a declining sequence of refresh rates, each refresh rate ofthe declining sequence being reduced by an amount from the rate of theprior refresh rate of the declining sequence of refresh rates andwherein the refreshing memory cells at the variable refresh rateincludes refreshing memory cells at each rate of the declining sequenceof refresh rates.

In Example 59, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the generating a test datapattern as an output of an algorithm includes generating a patternedsequence of multiplexer input selection signals, selecting inputs of amultiplexer in response to the patterned sequence of multiplexer inputselection signals, and outputting a test pattern from the multiplexer inresponse to the multiplexer input selecting.

In Example 60, the subject matter of Examples 41-60 (excluding thepresent Example) can optionally include that the generating a patternedsequence of multiplexer input selection signals, includes:

selecting a mode of a multi-mode pattern sequencer having a shiftregister comprising a plurality of bit registers, a finite state machinecomprising linear feedback polynomial logic coupled to the bit registersof the shift register, combinational logic including a plurality ofcounters, and a plurality of modes of operation including a fixedpattern mode, a clock signal pattern mode and a and a linear feedbackmode;

and operating the multi-mode pattern sequencer in the selected modewherein:

operating the multi-mode pattern sequencer in the fixed pattern modeincludes the shift register shifting a fixed pattern to the patternsequencer output;

operating the multi-mode pattern sequencer in the clock signal patternmode includes generating a clock signal at the pattern sequencer output,the clock signal having a programmable duty cycle in which the length ofa clock pulse within the clock period is programmable, the clock signalgenerating including timing the delay of initiation of the clock pulseof the clock signal within the clock period using a first counter of thecombinational logic, timing the duration of the clock pulse using asecond counter of the combinational logic, and the duration of theremaining period of the clock signal after the clock pulse until thebeginning of the next clock signal timing using a third counter of thecombinational logic; and

operating the multi-mode pattern sequencer in the linear feedback modeincludes generating a linear feedback polynomial pattern at the patternsequencer output, the generating a linear feedback polynomial patternincluding the linear feedback polynomial logic determining the nextstate of the finite state machine of the multi-mode pattern sequencer.

Example 61 is a memory controller for use with a memory having memorycells including spare memory cells, comprising:

an internal self-test logic circuit built in within the memorycontroller, the self-test logic circuit including: a test patterngenerator for generating test patterns and for testing memory cellswithin the memory using the generated test patterns; wherein the testpattern generator includes a plurality of generators including at leastone address generator configured to generate a pattern of memory celladdresses in response to an address instruction to traverse a memoryregion of a plurality of memory cells, and at least one data generatorconfigured to generate in response to a data instruction, a pattern ofdata for a pattern of test data, to be written in memory cells addressedby a pattern of memory cell addresses generated by the address generatorwherein the generated pattern of data is a selectable function of thepattern of memory cell addresses of the memory cells in which thegenerated pattern of data is to be written.

In Example 62, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the data generator isconfigured to invert data in a selectable striped pattern as a functionof one of the row address and the column address of the pattern ofmemory cell addresses of the memory cells in which the generated patternof data is to be written.

In Example 63, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the data generator isconfigured to invert data in a selectable checkerboard pattern as afunction of the Exclusive-OR function of the lowest order row addressbit and lowest order column address bit of the row and column addresses,respectively of the pattern of memory cell addresses of the memory cellsin which the generated pattern of data is to be written.

In Example 64, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the data generator isconfigured to generate a selectable pattern of data which is all logicalones for all memory cell addresses of the memory cells in which thegenerated pattern of data is to be written.

In Example 65, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the data generator isconfigured to selectively invert the pattern of data for all memory celladdresses of the memory cells in which the generated pattern of data isto be written.

In Example 66, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the data generator isconfigured to selectively rotate the generated pattern of data by a bitposition for all memory cell addresses of the memory cells in which thegenerated pattern of data is to be written.

In Example 67, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the data generator isconfigured to selectively repeat the rotation of a generated pattern ofdata a bit position a selectable number of times for all memory celladdresses of the memory cells in which the generated pattern of data isto be written.

In Example 68, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the plurality of generatorsincludes at least one address offset generator configured to generate aperiodic pattern of memory address offsets as a function of a period andthe data generator is configured to provide a selectable periodic datainversion function to selectively invert the pattern of data in aselectable periodic data inversion pattern.

In Example 69, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the data generator isconfigured to selectively invert the pattern of data in a stripe patternas a function of the periodic pattern of memory address offsetsgenerated by the address offset generator, wherein the stripe pattern isone of a column stripe, a row stripe, and a diagonal stripe.

In Example 70, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the period of the periodicpattern of memory address offsets is a function of one of the number ofrows and the number of columns of the memory cells addressed by thepattern of memory cell addresses generated by an address instruction.

In Example 71, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the period of the periodicpattern of memory address offsets is a function of an initial period andan adjustment to the initial period.

In Example 72, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the initial period is afunction of the direction of traversal of the memory cells addressed bythe pattern of memory cell addresses generated by an addressinstruction.

In Example 73, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include that the initial period is setto one of the number of rows and the number of columns of the memorycells addressed by the pattern of memory cell addresses generated by anaddress instruction.

In Example 74, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include a plurality of data generatorschained in a plurality of stages, each data generator configured togenerate a pattern of data as a function of memory addresses.

In Example 75, the subject matter of Examples 61-75 (excluding thepresent Example) can optionally include a plurality of registers adaptedto store mapping values, and a logical to physical address mapping logicconfigured to map logical addresses to physical addresses as a functionof the mapping values stored in the registers.

Example 76 is a computing device, comprising:

memory cells within the device including spare memory cells;

an internal self-test logic circuit built in within the device, theself-test logic circuit including: a test pattern generator forgenerating test patterns and for testing memory cells within the memoryfor defective memory cells using the generated test patterns; whereinthe test pattern generator includes a plurality of generators includingat least one address generator configured to generate in response to anaddress instruction, a pattern of memory cell addresses to traverse amemory region of a plurality of memory cells, and at least one datagenerator configured to generate in response to a data instruction, apattern of data for a pattern of test data, to be written in memorycells addressed by a pattern of memory cell addresses generated by theaddress generator wherein the generated pattern of data is a selectablefunction of the pattern of memory cell addresses of the memory cells inwhich the generated pattern of data is to be written; and

an internal self-repair logic circuit built in within the device, theinternal self-repair logic including a repair logic circuit responsiveto the internal self-test logic circuit and configured to repair adefective memory location by substituting a memory location of a sparememory cell, for a memory location having at least one defective memorycell.

In Example 77, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the data generator isconfigured to invert data in a selectable striped pattern as a functionof one of the row address and the column address of the pattern ofmemory cell addresses of the memory cells in which the generated patternof data is to be written.

In Example 78, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the data generator isconfigured to invert data in a selectable checkerboard pattern as afunction of the Exclusive-OR function of the lowest order row addressbit and lowest order column address bit of the row and column addresses,respectively of the pattern of memory cell addresses of the memory cellsin which the generated pattern of data is to be written.

In Example 79, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the data generator isconfigured to generate a selectable pattern of data which is all logicalones for all memory cell addresses of the memory cells in which thegenerated pattern of data is to be written.

In Example 80, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the data generator isconfigured to selectively invert the pattern of data for all memory celladdresses of the memory cells in which the generated pattern of data isto be written.

In Example 81, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the data generator isconfigured to selectively rotate the generated pattern of data by a bitposition for all memory cell addresses of the memory cells in which thegenerated pattern of data is to be written.

In Example 82, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the data generator isconfigured to selectively repeat the rotation of a generated pattern ofdata a bit position a selectable number of times for all memory celladdresses of the memory cells in which the generated pattern of data isto be written.

In Example 83, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the plurality of generatorsincludes at least one address offset generator configured to generate aperiodic pattern of memory address offsets as a function of a period andthe data generator is configured to provide a selectable periodic datainversion function to selectively invert the pattern of data in aselectable periodic data inversion pattern.

In Example 84, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the data generator isconfigured to selectively invert the pattern of data in a stripe patternas a function of the periodic pattern of memory address offsetsgenerated by the address offset generator, wherein the stripe pattern isone of a column stripe, a row stripe, and a diagonal stripe.

In Example 85, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the period of the periodicpattern of memory address offsets is a function of one of the number ofrows and the number of columns of the memory cells addressed by thepattern of memory cell addresses generated by an address instruction.

In Example 86, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the period of the periodicpattern of memory address offsets is a function of an initial period andan adjustment to the initial period.

In Example 87, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the initial period is afunction of the direction of traversal of the memory cells addressed bythe pattern of memory cell addresses generated by an addressinstruction.

In Example 88, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include that the initial period is setto one of the number of rows and the number of columns of the memorycells addressed by the pattern of memory cell addresses generated by anaddress instruction.

In Example 89, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include a plurality of data generatorschained in a plurality of stages, each data generator configured togenerate a pattern of data as a function of memory addresses.

In Example 90, the subject matter of Examples 76-90 (excluding thepresent Example) can optionally include a plurality of registers adaptedto store mapping values, and a logical to physical address mapping logicconfigured to map logical addresses to physical addresses as a functionof the mapping values stored in the registers.

Example 91 is a method for use with memory cells, comprising:

using an internal self-test logic circuit built in within a device,

generating test patterns; and

testing memory cells within a memory for defective memory cells usingthe generated test patterns;

wherein the test pattern generating includes generating in response toan address instruction, a pattern of memory cell addresses to traverse amemory region of a plurality of memory cells, and generating in responseto a data instruction, a pattern of data for a pattern of test data, tobe written in memory cells addressed by the generated pattern of memorycell addresses, and wherein the generating a pattern of data includesselecting a pattern of data and generating the selected pattern of dataas a selectable function of the generated pattern of memory celladdresses of the memory cells in which the generated pattern of data isto be written; and

using an internal self-repair logic circuit built in within the device,repairing, in responsive to the internal self-test logic circuit, adefective memory location by substituting a memory location of a sparememory cell, for a memory location having at least one defective memorycell.

In Example 92, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the generating the selectedpattern of data as a selectable function of the generated pattern ofmemory cell addresses includes inverting data in a selectable stripedpattern as a function of one of the row address and the column addressof the pattern of memory cell addresses of the memory cells in which thegenerated pattern of data is to be written.

In Example 93, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the generating the selectedpattern of data as a selectable function of the generated pattern ofmemory cell addresses includes inverting data in a selectablecheckerboard pattern as a function of the Exclusive-OR function of thelowest order row address bit and lowest order column address bit of therow and column addresses, respectively of the pattern of memory celladdresses of the memory cells in which the generated pattern of data isto be written.

In Example 94, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the generating a pattern ofdata includes generating a selectable pattern of data which is alllogical ones for all memory cell addresses of the memory cells in whichthe generated pattern of data is to be written.

In Example 95, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the generating a pattern ofdata includes selectively inverting the pattern of data for all memorycell addresses of the memory cells in which the generated pattern ofdata is to be written.

In Example 96, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the generating a pattern ofdata includes selectively rotating the generated pattern of data by abit position for all memory cell addresses of the memory cells in whichthe generated pattern of data is to be written.

In Example 97, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the rotating the generatedpattern of data includes selectively repeating the rotation of agenerated pattern of data a bit position a selectable number of timesfor all memory cell addresses of the memory cells in which the generatedpattern of data is to be written.

In Example 98, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the generating a pattern ofmemory cell addresses includes generating a periodic pattern of memoryaddress offsets as a function of a period, and wherein the generatingthe selected pattern of data as a selectable function of the generatedpattern of memory cell addresses includes providing a selectableperiodic data inversion function to selectively invert the pattern ofdata in a selectable periodic data inversion pattern.

In Example 99, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the generating the selectedpattern of data as a selectable function of the generated pattern ofmemory cell addresses includes selectively inverting the pattern of datain a stripe pattern as a function of the generated periodic pattern ofmemory address offsets, wherein the stripe pattern is one of a columnstripe, a row stripe, and a diagonal stripe.

In Example 100, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the period of the periodicpattern of memory address offsets is a function of one of the number ofrows and the number of columns of the memory cells addressed by thepattern of memory cell addresses generated by an address instruction.

In Example 101, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the period of the periodicpattern of memory address offsets is a function of an initial period andan adjustment to the initial period.

In Example 102, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the initial period is afunction of the direction of traversal of the memory cells addressed bythe pattern of memory cell addresses generated by an addressinstruction.

In Example 103, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the initial period is setto one of the number of rows and the number of columns of the memorycells addressed by the pattern of memory cell addresses generated by anaddress instruction.

In Example 104, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include that the generating the selectedpattern of data as a selectable function of the generated pattern ofmemory cell addresses includes generating selected patterns of data in aplurality of stages, each pattern of data of each stage being a functionof memory addresses.

In Example 105, the subject matter of Examples 91-105 (excluding thepresent Example) can optionally include mapping logical addresses tophysical addresses as a function of mapping values stored in registers.

Example 106 is directed to an apparatus comprising means to perform amethod as described in any preceding Example.

The described operations may be implemented as a method, apparatus orcomputer program product using standard programming and/or engineeringtechniques to produce software, firmware, hardware, or any combinationthereof. The described operations may be implemented as computer programcode maintained in a “computer readable storage medium”, where aprocessor may read and execute the code from the computer storagereadable medium. The computer readable storage medium includes at leastone of electronic circuitry, storage materials, inorganic materials,organic materials, biological materials, a casing, a housing, a coating,and hardware. A computer readable storage medium may comprise, but isnot limited to, a magnetic storage medium (e.g., hard disk drives,floppy disks, tape, etc.), optical storage (CD-ROMs, DVDs, opticaldisks, etc.), volatile and non-volatile memory devices (e.g., EEPROMs,ROMs, PROMs, RAMs, DRAMs, SRAMs, Flash Memory, firmware, programmablelogic, etc.), Solid State Devices (SSD), etc. The code implementing thedescribed operations may further be implemented in hardware logicimplemented in a hardware device (e.g., an integrated circuit chip,Programmable Gate Array (PGA), Application Specific Integrated Circuit(ASIC), etc.). Still further, the code implementing the describedoperations may be implemented in “transmission signals”, wheretransmission signals may propagate through space or through atransmission media, such as an optical fiber, copper wire, etc. Thetransmission signals in which the code or logic is encoded may furthercomprise a wireless signal, satellite transmission, radio waves,infrared signals, Bluetooth, etc. The program code embedded on acomputer readable storage medium may be transmitted as transmissionsignals from a transmitting station or computer to a receiving stationor computer. A computer readable storage medium is not comprised solelyof transmissions signals. Those skilled in the art will recognize thatmany modifications may be made to this configuration without departingfrom the scope of the present description, and that the article ofmanufacture may comprise suitable information bearing medium known inthe art. Of course, those skilled in the art will recognize that manymodifications may be made to this configuration without departing fromthe scope of the present description, and that the article ofmanufacture may comprise any tangible information bearing medium knownin the art.

In certain applications, a device in accordance with the presentdescription, may be embodied in a computer system including a videocontroller to render information to display on a monitor or otherdisplay coupled to the computer system, a device driver and a networkcontroller, such as a computer system comprising a desktop, workstation,server, mainframe, laptop, handheld computer, etc. Alternatively, thedevice embodiments may be embodied in a computing device that does notinclude, for example, a video controller, such as a switch, router,etc., or does not include a network controller, for example.

The illustrated logic of figures may show certain events occurring in acertain order. In alternative embodiments, certain operations may beperformed in a different order, modified or removed. Moreover,operations may be added to the above described logic and still conformto the described embodiments. Further, operations described herein mayoccur sequentially or certain operations may be processed in parallel.Yet further, operations may be performed by a single processing unit orby distributed processing units.

The foregoing description of various embodiments has been presented forthe purposes of illustration and description. It is not intended to beexhaustive or to limit to the precise form disclosed. Many modificationsand variations are possible in light of the above teaching.

1. An apparatus for use with a memory having memory cells arranged inrows and columns of memory cells and including spare memory cells,comprising: an internal self-test logic circuit built in within theapparatus, the self-test logic circuit including: a test patterngenerator for generating test patterns and for testing memory cellswithin the memory using the generated test patterns; wherein the testpattern generator includes a plurality of generators including at leastone address generator configured to generate a pattern of memory celladdresses in response to an address instruction to traverse a memoryregion of a plurality of memory cells wherein each memory cell addressincludes a row address of row address bits and a column address ofcolumn address bits, and at least one data generator configured togenerate in response to a data instruction, a pattern of data for apattern of test data, to be written in memory cells addressed by apattern of memory cell addresses generated by the address generatorwherein the generated pattern of data is a selectable function of thepattern of memory cell addresses of the memory cells in which thegenerated pattern of data is to be written.
 2. The apparatus of claim 1wherein the data generator is configured to invert data in a selectablestriped pattern as a function of one of the row address and the columnaddress of the pattern of memory cell addresses of the memory cells inwhich the generated pattern of data is to be written.
 3. The apparatusof claim 1 wherein the data generator is configured to invert data in aselectable checkerboard pattern as a function of the Exclusive-ORfunction of the lowest order row address bit and lowest order columnaddress bit of the row and column addresses, respectively of the patternof memory cell addresses of the memory cells in which the generatedpattern of data is to be written.
 4. The apparatus of claim 1 whereinthe data generator is configured to generate a selectable pattern ofdata which is all logical ones for all memory cell addresses of thememory cells in which the generated pattern of data is to be written. 5.The apparatus of claim 1 wherein the data generator is configured toselectively invert the pattern of data for all memory cell addresses ofthe memory cells in which the generated pattern of data is to bewritten.
 6. The apparatus of claim 1 wherein the data generator isconfigured to selectively rotate the generated pattern of data by a bitposition for all memory cell addresses of the memory cells in which thegenerated pattern of data is to be written.
 7. The apparatus of claim 6wherein the data generator is configured to selectively repeat therotation of a generated pattern of data a bit position a selectablenumber of times for all memory cell addresses of the memory cells inwhich the generated pattern of data is to be written.
 8. The apparatusof claim 1 wherein the plurality of generators includes at least oneaddress offset generator configured to generate a periodic pattern ofmemory address offsets as a function of a period and the data generatoris configured to provide a selectable periodic data inversion functionto selectively invert the pattern of data in a selectable periodic datainversion pattern.
 9. The apparatus of claim 8 wherein the datagenerator is configured to selectively invert the pattern of data in astripe pattern as a function of the periodic pattern of memory addressoffsets generated by the address offset generator, wherein the stripepattern is one of a column stripe, a row stripe, and a diagonal stripe.10. The apparatus of claim 9 wherein the period of the periodic patternof memory address offsets is a function of one of the number of rows andthe number of columns of the memory cells addressed by the pattern ofmemory cell addresses generated by the address instruction.
 11. Theapparatus of claim 8 wherein the period of the periodic pattern ofmemory address offsets is a function of an initial period and anadjustment to the initial period.
 12. The apparatus of claim 11 whereinthe initial period is a function of the direction of traversal of thememory cells addressed by the pattern of memory cell addresses generatedby the address instruction.
 13. The apparatus of claim 11 wherein theinitial period is set to one of the number of rows and the number ofcolumns of the memory cells addressed by the pattern of memory celladdresses generated by the address instruction.
 14. The apparatus ofclaim 8 comprising a plurality of data generators chained in a pluralityof stages, each data generator configured to generate the pattern ofdata as a function of memory addresses.
 15. The apparatus of claim 14comprising a plurality of registers adapted to store mapping values, anda logical to physical address mapping logic configured to map logicaladdresses to physical addresses as a function of the mapping valuesstored in the registers.
 16. The apparatus of claim 1 furthercomprising: a memory having memory cells within the device includingspare memory cells; and an internal self-repair logic circuit built inwithin the device, the internal self-repair logic including a repairlogic circuit responsive to the internal self-test logic circuit andconfigured to repair a defective memory location by substituting amemory location of a spare memory cell, for a memory location having atleast one defective memory cell.
 17. (canceled)
 18. (canceled) 19.(canceled)
 20. (canceled)
 21. A method for use with memory cellsarranged in rows and columns of memory cells, comprising: using aninternal self-test logic circuit built in within a device, generatingtest patterns; and testing memory cells within a memory for defectivememory cells using the generated test patterns; wherein the test patterngenerating includes generating in response to an address instruction, apattern of memory cell addresses to traverse a memory region of aplurality of memory cells wherein each memory cell address includes arow address of row address bits and a column address of column addressbits, and generating in response to a data instruction, a pattern ofdata for a pattern of test data, to be written in memory cells addressedby the generated pattern of memory cell addresses, and wherein thegenerating a pattern of data includes selecting a pattern of data andgenerating the selected pattern of data as a selectable function of thegenerated pattern of memory cell addresses of the memory cells in whichthe generated pattern of data is to be written; and using an internalself-repair logic circuit built in within the device, repairing, inresponsive to the internal self-test logic circuit, a defective memorylocation by substituting a memory location of a spare memory cell, for amemory location having at least one defective memory cell.
 22. Themethod of claim 21 wherein the generating the selected pattern of dataas a selectable function of the generated pattern of memory celladdresses includes at least one of 1) inverting data in a selectablestriped pattern as a function of one of the row address and the columnaddress of the pattern of memory cell addresses of the memory cells inwhich the generated pattern of data is to be written, and 2) invertingdata in a selectable checkerboard pattern as a function of theExclusive-OR function of the lowest order row address bit and lowestorder column address bit of the row and column addresses, respectivelyof the pattern of memory cell addresses of the memory cells in which thegenerated pattern of data is to be written.
 23. The method of claim 21wherein the generating a pattern of data includes at least one of 1)generating a selectable pattern of data which is all logical ones forall memory cell addresses of the memory cells in which the generatedpattern of data is to be written, 2) selectively inverting the patternof data for all memory cell addresses of the memory cells in which thegenerated pattern of data is to be written, 3) selectively rotating thegenerated pattern of data by a bit position for all memory celladdresses of the memory cells in which the generated pattern of data isto be written, and 4) selectively repeating the rotation of a generatedpattern of data a bit position a selectable number of times for allmemory cell addresses of the memory cells in which the generated patternof data is to be written.
 24. The method of claim 21 wherein thegenerating a pattern of memory cell addresses includes generating aperiodic pattern of memory address offsets as a function of a period,and wherein the generating the selected pattern of data as a selectablefunction of the generated pattern of memory cell addresses includesproviding a selectable periodic data inversion function to selectivelyinvert the pattern of data in a selectable periodic data inversionpattern, wherein the generating the selected pattern of data as aselectable function of the generated pattern of memory cell addressesincludes selectively inverting the pattern of data in a stripe patternas a function of the generated periodic pattern of memory addressoffsets, wherein the stripe pattern is one of a column stripe, a rowstripe, and a diagonal stripe, and wherein the period of the periodicpattern of memory address offsets is a function of one of 1) the numberof rows of the memory cells addressed by the pattern of memory celladdresses generated by the address instruction, 2) the number of columnsof the memory cells addressed by the pattern of memory cell addressesgenerated by the address instruction, and 3) an initial period and anadjustment to the initial period, wherein the initial period is afunction of the direction of traversal of the memory cells addressed bythe pattern of memory cell addresses generated by the addressinstruction, and wherein the initial period is set to one of the numberof rows and the number of columns of the memory cells addressed by thepattern of memory cell addresses generated by the address instruction.25. The method of claim 24 wherein the generating the selected patternof data as a selectable function of the generated pattern of memory celladdresses includes generating selected patterns of data in a pluralityof chained stages, each pattern of data of each stage being a functionof memory addresses, and, in one of said chained stages, mapping logicaladdresses to physical addresses as a function of mapping values storedin registers.